Global Constraint Catalog: Csame

5.338. same_interval

DESCRIPTION

LINKS

GRAPH

Origin

Derived from $𝚜𝚊𝚖𝚎$ .

Constraint

$𝚜𝚊𝚖𝚎_𝚒𝚗𝚝𝚎𝚛𝚟𝚊𝚕 (𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 1, 𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 2, 𝚂𝙸𝚉𝙴_𝙸𝙽𝚃𝙴𝚁𝚅𝙰𝙻)$

Arguments

$𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 1$	$𝚌𝚘𝚕𝚕𝚎𝚌𝚝𝚒𝚘𝚗 (𝚟𝚊𝚛 - 𝚍𝚟𝚊𝚛)$
$𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 2$	$𝚌𝚘𝚕𝚕𝚎𝚌𝚝𝚒𝚘𝚗 (𝚟𝚊𝚛 - 𝚍𝚟𝚊𝚛)$
$𝚂𝙸𝚉𝙴_𝙸𝙽𝚃𝙴𝚁𝚅𝙰𝙻$	$𝚒𝚗𝚝$

Restrictions

| 𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 1 | = | 𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 2 |

𝚛𝚎𝚚𝚞𝚒𝚛𝚎𝚍

(𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 1, 𝚟𝚊𝚛)

𝚛𝚎𝚚𝚞𝚒𝚛𝚎𝚍

(𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 2, 𝚟𝚊𝚛)

𝚂𝙸𝚉𝙴_𝙸𝙽𝚃𝙴𝚁𝚅𝙰𝙻 > 0

Purpose

Let $N_{i}$ (respectively $M_{i}$ ) denote the number of variables of the collection $𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 1$ (respectively $𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 2$ ) that take a value in the interval $[𝚂𝙸𝚉𝙴_𝙸𝙽𝚃𝙴𝚁𝚅𝙰𝙻 \cdot i, 𝚂𝙸𝚉𝙴_𝙸𝙽𝚃𝙴𝚁𝚅𝙰𝙻 \cdot i + 𝚂𝙸𝚉𝙴_𝙸𝙽𝚃𝙴𝚁𝚅𝙰𝙻 - 1$ . For all integer $i$ we have $N_{i} = M_{i}$ .

Example

(〈1, 7, 6, 0, 1, 7〉, 〈8, 8, 8, 0, 1, 2〉, 3)

In the example, the third argument $𝚂𝙸𝚉𝙴_𝙸𝙽𝚃𝙴𝚁𝚅𝙰𝙻 = 3$ defines the following family of intervals $[3 \cdot k, 3 \cdot k + 2]$ , where $k$ is an integer. Consequently the values of the collection $〈 1, 7, 6, 0, 1, 7 〉$ are respectively located within intervals $[0, 2]$ , $[6, 8]$ , $[6, 8]$ , $[0, 2]$ , $[0, 2]$ , $[6, 8]$ . Therefore intervals $[0, 2]$ and $[6, 8]$ are respectively used 3 and 3 times. Similarly, the values of the collection $〈 8, 8, 8, 0, 1, 2 〉$ are respectively located within intervals $[6, 8]$ , $[6, 8]$ , $[6, 8]$ , $[0, 2]$ , $[0, 2]$ , $[0, 2]$ . As before intervals $[0, 2]$ and $[6, 8]$ are respectively used 3 and 3 times. Consequently the $𝚜𝚊𝚖𝚎_𝚒𝚗𝚝𝚎𝚛𝚟𝚊𝚕$ constraint holds. Figure 5.338.1 illustrates this correspondence.

Figure 5.338.1. Illustration of the correspondence between the items of the $𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 1$ and of the $𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 2$ collections of the Example slot

Typical

| 𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 1 | > 1

𝚛𝚊𝚗𝚐𝚎

(𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 1 . 𝚟𝚊𝚛) > 1

𝚛𝚊𝚗𝚐𝚎

(𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 2 . 𝚟𝚊𝚛) > 1

𝚂𝙸𝚉𝙴_𝙸𝙽𝚃𝙴𝚁𝚅𝙰𝙻 > 1

𝚂𝙸𝚉𝙴_𝙸𝙽𝚃𝙴𝚁𝚅𝙰𝙻 <

𝚛𝚊𝚗𝚐𝚎

(𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 1 . 𝚟𝚊𝚛)

𝚂𝙸𝚉𝙴_𝙸𝙽𝚃𝙴𝚁𝚅𝙰𝙻 <

𝚛𝚊𝚗𝚐𝚎

(𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 2 . 𝚟𝚊𝚛)

Symmetries

Arguments are permutable w.r.t. permutation $(𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 1, 𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 2)$ $(𝚂𝙸𝚉𝙴_𝙸𝙽𝚃𝙴𝚁𝚅𝙰𝙻)$ .
Items of $𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 1$ are permutable.
Items of $𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 2$ are permutable.
An occurrence of a value of $𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 . 𝚟𝚊𝚛$ that belongs to the $k$ -th interval, of size $𝚂𝙸𝚉𝙴_𝙸𝙽𝚃𝙴𝚁𝚅𝙰𝙻$ , can be replaced by any other value of the same interval.

Arg. properties

Aggregate: $𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 1 (𝚞𝚗𝚒𝚘𝚗)$ , $𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 2 (𝚞𝚗𝚒𝚘𝚗)$ , $𝚂𝙸𝚉𝙴_𝙸𝙽𝚃𝙴𝚁𝚅𝙰𝙻 (𝚒𝚍)$ .

Algorithm

See algorithm of the $𝚜𝚊𝚖𝚎$ constraint.

Used in

$𝚔_𝚜𝚊𝚖𝚎_𝚒𝚗𝚝𝚎𝚛𝚟𝚊𝚕$ .

See also

implies: $𝚞𝚜𝚎𝚍_𝚋𝚢_𝚒𝚗𝚝𝚎𝚛𝚟𝚊𝚕$ .

soft variant: $𝚜𝚘𝚏𝚝_𝚜𝚊𝚖𝚎_𝚒𝚗𝚝𝚎𝚛𝚟𝚊𝚕_𝚟𝚊𝚛$ (variable-based violation measure).

specialisation: $𝚜𝚊𝚖𝚎$ ( $𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎 / 𝚌𝚘𝚗𝚜𝚝𝚊𝚗𝚝$ replaced by $𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎$ ).

system of constraints: $𝚔_𝚜𝚊𝚖𝚎_𝚒𝚗𝚝𝚎𝚛𝚟𝚊𝚕$ .

Keywords

characteristic of a constraint: sort based reformulation.

combinatorial object: permutation.

constraint arguments: constraint between two collections of variables.

modelling: interval.

Arc input(s)

$𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 1$ $𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 2$

Arc generator

𝑃𝑅𝑂𝐷𝑈𝐶𝑇

\mapsto 𝚌𝚘𝚕𝚕𝚎𝚌𝚝𝚒𝚘𝚗 (𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 1, 𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 2)

Arc arity

Arc constraint(s)

\begin{matrix} 𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 1 . 𝚟𝚊𝚛 / 𝚂𝙸𝚉𝙴_𝙸𝙽𝚃𝙴𝚁𝚅𝙰𝙻 = \\ 𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 2 . 𝚟𝚊𝚛 / 𝚂𝙸𝚉𝙴_𝙸𝙽𝚃𝙴𝚁𝚅𝙰𝙻 \end{matrix}

Graph property(ies)

• for all connected components:

𝐍𝐒𝐎𝐔𝐑𝐂𝐄

=

𝐍𝐒𝐈𝐍𝐊

•

𝐍𝐒𝐎𝐔𝐑𝐂𝐄

= | 𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 1 |

•

𝐍𝐒𝐈𝐍𝐊

= | 𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 2 |

Graph model

Parts (A) and (B) of Figure 5.338.2 respectively show the initial and final graph associated with the Example slot. Since we use the $𝐍𝐒𝐎𝐔𝐑𝐂𝐄$ and $𝐍𝐒𝐈𝐍𝐊$ graph properties, the source and sink vertices of the final graph are stressed with a double circle. Since there is a constraint on each connected component of the final graph we also show the different connected components. Each of them corresponds to an equivalence class according to the arc constraint. The $𝚜𝚊𝚖𝚎_𝚒𝚗𝚝𝚎𝚛𝚟𝚊𝚕$ constraint holds since:

Each connected component of the final graph has the same number of sources and of sinks.
The number of sources of the final graph is equal to $| 𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 1 |$ .
The number of sinks of the final graph is equal to $| 𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 2 |$ .

Figure 5.338.2. Initial and final graph of the $𝚜𝚊𝚖𝚎_𝚒𝚗𝚝𝚎𝚛𝚟𝚊𝚕$ constraint

(a)

(b)

Signature

Since the initial graph contains only sources and sinks, and since isolated vertices are eliminated from the final graph, we make the following observations:

Sources of the initial graph cannot become sinks of the final graph,
Sinks of the initial graph cannot become sources of the final graph.

From the previous observations and since we use the $𝑃𝑅𝑂𝐷𝑈𝐶𝑇$ arc generator on the collections $𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 1$ and $𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 2$ , we have that the maximum number of sources and sinks of the final graph is respectively equal to $| 𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 1 |$ and $| 𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 2 |$ . Therefore we can rewrite $𝐍𝐒𝐎𝐔𝐑𝐂𝐄 = | 𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 1 |$ to $𝐍𝐒𝐎𝐔𝐑𝐂𝐄 \geq | 𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 1 |$ and simplify $\underset{̲}{\bar{𝐍𝐒𝐎𝐔𝐑𝐂𝐄}}$ to $\bar{𝐍𝐒𝐎𝐔𝐑𝐂𝐄}$ . In a similar way, we can rewrite $𝐍𝐒𝐈𝐍𝐊 = | 𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 2 |$ to $𝐍𝐒𝐈𝐍𝐊 \geq | 𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 2 |$ and simplify $\underset{̲}{\bar{𝐍𝐒𝐈𝐍𝐊}}$ to $\bar{𝐍𝐒𝐈𝐍𝐊}$ .

Global Constraint Catalog

5. Global Constraint Catalogue

5.338. same_interval

Figure 5.338.1. Illustration of the correspondence between the items of the 𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂1 and of the 𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂2 collections of the Example slot

Figure 5.338.2. Initial and final graph of the 𝚜𝚊𝚖𝚎_𝚒𝚗𝚝𝚎𝚛𝚟𝚊𝚕 constraint

Figure 5.338.1. Illustration of the correspondence between the items of the $𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 1$ and of the $𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 2$ collections of the Example slot

Figure 5.338.2. Initial and final graph of the $𝚜𝚊𝚖𝚎_𝚒𝚗𝚝𝚎𝚛𝚟𝚊𝚕$ constraint