Algorithm 864-Reference-Cited by-同舟云学术

Algorithm 864

Published:2007-03 Issue:1 Volume:33 Page:7
ISSN:0098-3500
Container-title:ACM Transactions on Mathematical Software
language:en
Short-container-title:ACM Trans. Math. Softw.

Author:

Martello Silvano¹,Pisinger David²,Vigo Daniele¹,Boef Edgar Den³,Korst Jan³

Affiliation:

1. University of Bologna, Bologna, Italy

2. University of Copenhagen, Copenhagen, Denmark

3. Philips Research Laboratories, Eindhoven, The Netherlands

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Applied Mathematics,Software

Link

https://dl.acm.org/doi/pdf/10.1145/1206040.1206047

Reference12 articles.

1. Barták R. 1998. Online guide to constraint programming. Available online at http://kti.mff.cuni.cz/~bartak/constraints/. Barták R. 1998. Online guide to constraint programming. Available online at http://kti.mff.cuni.cz/~bartak/constraints/.

2. Constraint satisfaction problems: Algorithms and applications

3. Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems

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. 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. Gaschnig J. 1979. Performance measurement and analysis of certain search algorithms. Tech. rep. CMU-CS-79-124. Carnegie-Mellon University Pittsburgh PA.

Cited by 64 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Container loading problem based on robotic loader system: An optimization approach;Expert Systems with Applications;2024-02

2. Solving a 3D bin packing problem with stacking constraints;Computers & Industrial Engineering;2024-02

3. Neural Packing: from Visual Sensing to Reinforcement Learning;ACM Transactions on Graphics;2023-12-05

4. Solving Pallet loading Problem with Real-World Constraints;2023-07-23

5. A hybrid biogeography-based optimization algorithm for three-dimensional bin size designing and packing problem;Computers & Industrial Engineering;2023-06