A Simple and Effective Decomposition for the Multidimensional Binpacking Constraint
The multibin_packing constraint captures a fundamental substructure of many assignment problems, where a set of items, each with a fixed number of dimensions, must be assigned to a number of bins with limited capacities. In this work we propose a simple decomposition for multibin_packing that uses a bin_packing constraint for each dimension, a set of all_different constraints automatically derived from a conflict graph, plus two alternative symmetry breaking approaches. Despite its simplicity, the proposed decomposition is very effective on a number of instances recently proposed in the literature.
KeywordsMaximal Clique Average Computation Time Hard Instance Simple Decomposition Load Variable
Unable to display preview. Download preview PDF.
- 1.Beldiceanu, N., Carlsson, M., Rampon, J.X.: Global constraint catalog. SICS Research Report (2005)Google Scholar
- 4.Gecode Team. Gecode: Generic constraint development environment (2013), http://www.gecode.org
- 5.Martello, S., Toth, P.: Knapsack problems: algorithms and computer implementations. John Wiley & Sons, Inc. (1990)Google Scholar
- 8.Rossi, F., Van Beek, P., Walsh, T.: Handbook of constraint programming. Elsevier Science (2006)Google Scholar