The model in [1] introduces two families of variables:
These two sets of variables are linked with a bin-packing constraint(X,caps,L) where c is the vector of capacities for each tank. This constraint enforces L[p] = sumtintanks (X[t]=p)∗capa[t]∀p
Some table constraints can be added on some pairs of neighbouring tank variables x[i],x[j] to avoid incompatible products to be located next to each other.
The objective is to maximise the empty volume i.e. variable L[0].
[1] Pierre Schaus, Jean-Charles Régin, Rowan Van Schaeren, Wout Dullaert, Birger Raa: Cardinality Reasoning for Bin-Packing Constraint: Application to a Tank Allocation Problem. CP 2012: 815-822
File | Type | Notes |
---|---|---|
TankAlloc-051.essence | Essence |