5.268. multi_inter_distance

DESCRIPTIONLINKS
Origin

[OuelletQuimper11]

Constraint

πš–πšžπš•πšπš’_πš’πš—πšπšŽπš›_πšπš’πšœπšπšŠπš—πšŒπšŽ(πš…π™°πšπ™Έπ™°π™±π™»π™΄πš‚,π™»π™Έπ™Όπ™Έπšƒ,π™³π™Έπš‚πšƒ)

Synonyms

πš–πšžπš•πšπš’_πšŠπš•πš•_πš–πš’πš—_πšπš’πšœπšπšŠπš—πšŒπšŽ, πš–πšžπš•πšπš’_πšŠπš•πš•_πš–πš’πš—_πšπš’πšœπš, πšœπš•πš’πšπš’πš—πš_πšŠπšπš–πš˜πšœπš, πšŠπšπš–πš˜πšœπš_πšœπš•πš’πšπš’πš—πš.

Arguments
πš…π™°πšπ™Έπ™°π™±π™»π™΄πš‚πšŒπš˜πš•πš•πšŽπšŒπšπš’πš˜πš—(πšŸπšŠπš›-πšπšŸπšŠπš›)
π™»π™Έπ™Όπ™Έπšƒπš’πš—πš
π™³π™Έπš‚πšƒπš’πš—πš
Restrictions
πš›πšŽπššπšžπš’πš›πšŽπš(πš…π™°πšπ™Έπ™°π™±π™»π™΄πš‚,πšŸπšŠπš›)
π™»π™Έπ™Όπ™Έπšƒ>0
π™³π™Έπš‚πšƒ>0
Purpose

Enforce that at most π™»π™Έπ™Όπ™Έπšƒ variables of the collection πš…π™°πšπ™Έπ™°π™±π™»π™΄πš‚ are assigned values in any set consisting of π™³π™Έπš‚πšƒ consecutive integer values.

Example
(4,0,9,4,7,2,3)

The πš–πšžπš•πšπš’_πš’πš—πšπšŽπš›_πšπš’πšœπšπšŠπš—πšŒπšŽ constraint holds since, for each set of π™³π™Έπš‚πšƒ=3 consecutive values, no more than π™»π™Έπ™Όπ™Έπšƒ=2 variables of the πš…π™°πšπ™Έπ™°π™±π™»π™΄πš‚ collection 〈4,0,9,4,7βŒͺ are assigned a value from that set:

  • At most two, in fact one, variables of the πš…π™°πšπ™Έπ™°π™±π™»π™΄πš‚ collection are assigned a value from the set {0,1,2}.

  • At most two, in fact zero, variables of the πš…π™°πšπ™Έπ™°π™±π™»π™΄πš‚ collection are assigned a value from the set {1,2,3}.

  • At most two, in fact two, variables of the πš…π™°πšπ™Έπ™°π™±π™»π™΄πš‚ collection are assigned a value from the set {2,3,4}.

  • At most two, in fact two, variables of the πš…π™°πšπ™Έπ™°π™±π™»π™΄πš‚ collection are assigned a value from the set {3,4,5}.

  • At most two, in fact two, variables of the πš…π™°πšπ™Έπ™°π™±π™»π™΄πš‚ collection are assigned a value from the set {4,5,6}.

  • At most two, in fact one, variables of the πš…π™°πšπ™Έπ™°π™±π™»π™΄πš‚ collection are assigned a value from the set {5,6,7}.

  • At most two, in fact one, variables of the πš…π™°πšπ™Έπ™°π™±π™»π™΄πš‚ collection are assigned a value from the set {6,7,8}.

  • At most two, in fact two, variables of the πš…π™°πšπ™Έπ™°π™±π™»π™΄πš‚ collection are assigned a value from the set {7,8,9}.

Typical
π™»π™Έπ™Όπ™Έπšƒ>1
π™»π™Έπ™Όπ™Έπšƒ<|πš…π™°πšπ™Έπ™°π™±π™»π™΄πš‚|
π™³π™Έπš‚πšƒ>1
π™³π™Έπš‚πšƒ<πš›πšŠπš—πšπšŽ(πš…π™°πšπ™Έπ™°π™±π™»π™΄πš‚.πšŸπšŠπš›)
Symmetries
  • Items of πš…π™°πšπ™Έπ™°π™±π™»π™΄πš‚ are permutable.

  • One and the same constant can be added to the πšŸπšŠπš› attribute of all items of πš…π™°πšπ™Έπ™°π™±π™»π™΄πš‚.

  • π™»π™Έπ™Όπ™Έπšƒ can be increased.

  • π™Όπ™Έπ™½π™³π™Έπš‚πšƒ can be decreased to any value β‰₯1.

Arg. properties

Contractible wrt. πš…π™°πšπ™Έπ™°π™±π™»π™΄πš‚.

Usage

The πš–πšžπš•πšπš’_πš’πš—πšπšŽπš›_πšπš’πšœπšπšŠπš—πšŒπšŽ constraint was tested for scheduling tasks that all have the same fixed duration in the context of air traffic management.

Algorithm

P.Β Ouellet and C.-G.Β Quimper came up with a cubic time complexity algorithm achieving bound-consistency inΒ [OuelletQuimper11].

See also

generalisation: πšŒπšžπš–πšžπš•πšŠπšπš’πšŸπšŽΒ (πš•πš’πš—πšŽ πšœπšŽπšπš–πšŽπš—πš, of same length, replaced by πš•πš’πš—πšŽ πšœπšŽπšπš–πšŽπš—πš).

specialisation: πšŠπš•πš•_πš–πš’πš—_πšπš’πšœπšΒ (π™»π™Έπ™Όπ™Έπšƒ parameter set to 1), πšŒπšŠπš›πšπš’πš—πšŠπš•πš’πšπš’_πšŠπšπš–πš˜πšœπšΒ (window of π™³π™Έπš‚πšƒ consecutive values replaced by window of size 1).

Keywords

application area: air traffic management.

constraint type: predefined constraint, value constraint, scheduling constraint.

filtering: bound-consistency.

modelling: at most.