skip to main content
article

Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem

Published: 01 March 2007 Publication History

Abstract

We consider the problem of orthogonally packing a given set of rectangular-shaped boxes into the minimum number of three-dimensional rectangular bins. The problem is NP-hard in the strong sense and extremely difficult to solve in practice. We characterize relevant subclasses of packing and present an algorithm which is able to solve moderately large instances to optimality. Extensive computational experiments compare the algorithm for the three-dimensional bin packing when solving general orthogonal packings and when restricted to robot packings.

Supplementary Material

ZIP File (864.zip)
Software for General and robot-packable variants of the three-dimensional bin packing problem

References

[1]
Barták, R. 1998. Online guide to constraint programming. Available online at http://kti.mff.cuni.cz/~bartak/constraints/.
[2]
Brailsford, S., Potts, C., and Smith, B. 1999. Constraint satisfaction problems: Algorithms and applications. European J. Operat. Res. 119, 557--581.
[3]
den Boef, E., Korst, J., Martello, S., Pisinger, D., and Vigo, D. 2005. Erratum to the three-dimensional bin packing problem: Robot-packable and orthogonal variants of packing problems. Operat. Res. 53, 735--736.
[4]
Dyckhoff, H., Scheithauer, G., and Terno, J. 1997. Cutting and Packing. In Annotated Bibliographies in Combinatorial Optimization, M. Dell'Amico, F. Maffioli, and S. Martello, Eds. John Wiley & Sons, Chichester, England, 393--413.
[5]
Gaschnig, J. 1979. Performance measurement and analysis of certain search algorithms. Tech. rep. CMU-CS-79-124. Carnegie-Mellon University, Pittsburgh, PA.
[6]
Haralick, R. and Elliot, G. 1980. Increasing tree search efficiency for constraint satisfaction problems. Artific. Intell. 14, 263--313.
[7]
Lodi, A., Martello, S., and Monaci, M. 2002a. Two-dimensional packing problems: A survey. European J. Operat. Res. 141, 3--13.
[8]
Lodi, A., Martello, S., and Vigo, D. 2002b. Recent advances on two-dimensional bin packing problems. Discr. Appl. Math. 123, 379--396.
[9]
Martello, S., Pisinger, D., and Vigo, D. 2000. The three-dimensional bin packing problem. Operat. Res. 48, 256--267.
[10]
Martello, S. and Vigo, D. 1998. Exact solution of the two-dimensional finite bin packing problem. Manage. Sci. 44, 388--399.
[11]
Sabin, D. and Freuder, E. 1994. Contradicting conventional wisdom in constraint satisfaction. In Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming, PPCP'94, Rosario, Orcas Island, WA, USA, May 1994, A. Borning, Ed. Lecture Notes in Computer Science, vol. 874. Springer-Verlag, Berlin and Heidelberg, Germany, 10--20.
[12]
Scheithauer, G. 1997. Equivalence and dominance for problems of optimal packing of rectangles. Ricerca Operat. 83, 3--34.

Cited By

View all
  • (2025)A new branch-and-cut approach for integrated planning in additive manufacturingEuropean Journal of Operational Research10.1016/j.ejor.2024.10.040322:2(427-447)Online publication date: Apr-2025
  • (2024)Container loading problem based on robotic loader systemExpert Systems with Applications: An International Journal10.1016/j.eswa.2023.121222236:COnline publication date: 1-Feb-2024
  • (2024)3D dynamic heterogeneous robotic palletization problemEuropean Journal of Operational Research10.1016/j.ejor.2024.02.007316:2(584-596)Online publication date: Jul-2024
  • Show More Cited By

Index Terms

  1. Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Transactions on Mathematical Software
      ACM Transactions on Mathematical Software  Volume 33, Issue 1
      March 2007
      134 pages
      ISSN:0098-3500
      EISSN:1557-7295
      DOI:10.1145/1206040
      Issue’s Table of Contents

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 01 March 2007
      Published in TOMS Volume 33, Issue 1

      Permissions

      Request permissions for this article.

      Check for updates

      Badges

      Author Tags

      1. Bin packing
      2. branch-and-bound
      3. constraint programming
      4. exact algorithms

      Qualifiers

      • Article

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)46
      • Downloads (Last 6 weeks)3
      Reflects downloads up to 15 Feb 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2025)A new branch-and-cut approach for integrated planning in additive manufacturingEuropean Journal of Operational Research10.1016/j.ejor.2024.10.040322:2(427-447)Online publication date: Apr-2025
      • (2024)Container loading problem based on robotic loader systemExpert Systems with Applications: An International Journal10.1016/j.eswa.2023.121222236:COnline publication date: 1-Feb-2024
      • (2024)3D dynamic heterogeneous robotic palletization problemEuropean Journal of Operational Research10.1016/j.ejor.2024.02.007316:2(584-596)Online publication date: Jul-2024
      • (2024)Solving a 3D bin packing problem with stacking constraintsComputers & Industrial Engineering10.1016/j.cie.2023.109814188(109814)Online publication date: Feb-2024
      • (2024)A three-dimensional bin packing problem with item fragmentation and its application in the storage location assignment problem4OR10.1007/s10288-024-00576-6Online publication date: 4-Sep-2024
      • (2024)Research on Online Palletizing Algorithm Based on BufferAdvanced Manufacturing and Automation XIII10.1007/978-981-97-0665-5_6(40-48)Online publication date: 25-Feb-2024
      • (2023)Neural Packing: from Visual Sensing to Reinforcement LearningACM Transactions on Graphics10.1145/361835442:6(1-11)Online publication date: 5-Dec-2023
      • (2023)A hybrid biogeography-based optimization algorithm for three-dimensional bin size designing and packing problemComputers and Industrial Engineering10.1016/j.cie.2023.109239180:COnline publication date: 1-Jun-2023
      • (2022)On-line three-dimensional packing problems: A review of off-line and on-line solution approachesComputers & Industrial Engineering10.1016/j.cie.2022.108122168(108122)Online publication date: Jun-2022
      • (2022)A two-step evolutionary algorithm for the distributor’s pallet loading problem with multi-size palletsFlexible Services and Manufacturing Journal10.1007/s10696-022-09461-y35:4(1256-1275)Online publication date: 22-Aug-2022
      • Show More Cited By

      View Options

      Login options

      Full Access

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media