An MDD Approach to Multidimensional Bin Packing

  • Brian Kell
  • Willem-Jan van Hoeve
Conference paper

DOI: 10.1007/978-3-642-38171-3_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7874)
Cite this paper as:
Kell B., van Hoeve WJ. (2013) An MDD Approach to Multidimensional Bin Packing. In: Gomes C., Sellmann M. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2013. Lecture Notes in Computer Science, vol 7874. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Brian Kell
    • 1
  • Willem-Jan van Hoeve
    • 2
  1. 1.Department of Mathematical SciencesCarnegie Mellon UniversityUSA
  2. 2.Tepper School of BusinessCarnegie Mellon UniversityUSA

Personalised recommendations