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

Authors:
Oluf Faroe;David Pisinger;Martin Zachariasen
Affiliations:
-;-;-
Venue:
INFORMS Journal on Computing
Year:
2003

Citing 0
Cited 17

A strategic knowledge-based planning system for freight forwarding industry

Expert Systems with Applications: An International Journal
Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem

INFORMS Journal on Computing
A General Purpose Algorithm for Three-Dimensional Packing

INFORMS Journal on Computing
A Set-Covering-Based Heuristic Approach for Bin-Packing Problems

INFORMS Journal on Computing
Solving the one-dimensional bin packing problem with a weight annealing heuristic

Computers and Operations Research
Software applications to a real-world cutting problem of a German wood panel manufacturer: a case study

CEA'07 Proceedings of the 2007 annual Conference on International Conference on Computer Engineering and Applications
New resolution algorithm and pretreatments for the two-dimensional bin-packing problem

Computers and Operations Research
Development of an optimised transport logistics system for supporting distribution operations

International Journal of Computer Applications in Technology
Translational packing of arbitrary polytopes

Computational Geometry: Theory and Applications
A particular approach for the Three-dimensional Packing Problem with additional constraints

Computers and Operations Research
Smart container loading

Journal of Computational Methods in Sciences and Engineering - Special Supplement Issue in Section A and B: Selected Papers from the ISCA International Conference on Software Engineering and Data Engineering, 2009
An iterated construction approach with dynamic prioritization for solving the container loading problems

Expert Systems with Applications: An International Journal
A hybrid genetic algorithm for packing in 3d with deepest bottom left with fill method

ADVIS'04 Proceedings of the Third international conference on Advances in Information Systems
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
Space defragmentation heuristic for 2D and 3D bin packing problems

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Packing first, routing second-a heuristic for the vehicle routing and loading problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The three-dimensional bin-packing problem is the problem of orthogonally packing a set of boxes into a minimum number of three-dimensional bins. In this paper we present a heuristic algorithm based on guided local search. Starting with an upper bound on the number of bins obtained by a greedy heuristic, the presented algorithm iteratively decreases the number of bins, each time searching for a feasible packing of the boxes. The process terminates when a given time limit has been reached or the upper bound matches a precomputed lower bound. The algorithm can also be applied to two-dimensional bin-packing problems by having a constant depth for all boxes and bins. Computational experiments are reported for two- and three-dimensional instances with up to 200 boxes, showing that the algorithm on average finds better solutions than do heuristics from the literature.