An MDD Approach to Multidimensional Bin Packing
We investigate the application of multivalued decision diagrams (MDDs) to multidimensional bin packing problems. In these problems, each bin has a multidimensional capacity and each item has an associated multidimensional size. We develop several MDD representations for this problem, and explore different MDD construction methods including a new heuristic-driven depth-first compilation scheme. We also derive MDD restrictions and relaxations, using a novel application of a clustering algorithm to identify approximate equivalence classes among MDD nodes. Our experimental results show that these techniques can significantly outperform current CP and MIP solvers.
KeywordsPartial Solution Constraint Satisfaction Problem Binary Decision Diagram Item Size Feasible Instance
Unable to display preview. Download preview PDF.
- 3.Bergman, D., Cire, A.A., van Hoeve, W.-J., Yunes, T.: BDD-based heuristics for binary optimization (submitted, 2013)Google Scholar
- 7.Heckbert, P.: Color image quantization for frame buffer display. In: SIGGRAPH 1982, pp. 297–307. ACM, New York (1982)Google Scholar
- 9.Knuth, D.E.: The Art of Computer Programming, vol. 4, fascicle 1: Bitwise Tricks & Techniques; Binary Decision Diagrams. Addison-Wesley (2009)Google Scholar
- 13.Wegener, I.: Branching Programs and Binary Decision Diagrams: Theory and Applications. SIAM, Philadelphia (2000)Google Scholar