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

Authors:
Silvano Martello;David Pisinger;Daniele Vigo;Edgar Den Boef;Jan Korst
Affiliations:
University of Bologna, Bologna, Italy;University of Copenhagen, Copenhagen, Denmark;University of Bologna, Bologna, Italy;Philips Research Laboratories, Eindhoven, The Netherlands;Philips Research Laboratories, Eindhoven, The Netherlands
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
2007

Citing 5
Cited 8

Exact Solution of the Two-Dimensional Finite Bon Packing Problem

Management Science
Contradicting Conventional Wisdom in Constraint Satisfaction

PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
The Three-Dimensional Bin Packing Problem

Operations Research
Recent advances on two-dimensional bin packing problems

Discrete Applied Mathematics
Erratum to "The Three-Dimensional Bin Packing Problem": Robot-Packable and Orthogonal Variants of Packing Problems

Operations Research

Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem

INFORMS Journal on Computing
Erratum to "The Three-Dimensional Bin Packing Problem": Robot-Packable and Orthogonal Variants of Packing Problems

Operations Research
Heuristic approaches for the two- and three-dimensional knapsack packing problem

Computers and Operations Research
Multi-dimensional bin packing problems with guillotine constraints

Computers and Operations Research
A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem

Computers and Operations Research
A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP

Computers and Operations Research
A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints

Computers and Operations Research
A global search framework for practical three-dimensional packing with variable carton orientations

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.