A General Purpose Algorithm for Three-Dimensional Packing

Authors:
Lorenzo Brunetta;Philippe Grégoire
Affiliations:
Università di Padova, Dipartimento di Ingegneria dell'Informazione, Via Gradenigo 6A, I-35131 Padova, Italy;Université Libre de Bruxelles, Service d'Optimisation, CP 210/01, Bvd du Triomphe, B-1050 Bruxelles, Belgium
Venue:
INFORMS Journal on Computing
Year:
2005

Citing 3
Cited 2

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
The Three-Dimensional Bin Packing Problem

Operations Research
Guided Local Search for the Three-Dimensional Bin-Packing Problem

INFORMS Journal on Computing

Decision support for packing in warehouses

ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
A GRASP/Path Relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a fast and efficient heuristic algorithm for solving a large class of three-dimensional packing problems with the objective of maximizing the average volumetric utilization of containers that might be of different dimensions. The algorithm is a tree-search algorithm that implicitly explores the solution space. The algorithm relies on the fact that, in practice, (i) the number of different types of objects to pack is limited and known in advance, and (ii) the number of occurrences of those objects is sufficiently high to permit use of a pattern approach to solve, at least partially, the problem. Each node of the search tree is solved using an extension of a pallet-loading heuristic developed by Morabito and Morales to generate the patterns and of a container-loading heuristic developed by Pisinger to treat the objects not packed by the pattern approach. We report on our extensive computations on a new large library of instances derived from real world applications.