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

@article{Faroe2003GuidedLS,
  title={Guided Local Search for the Three-Dimensional Bin-Packing Problem},
  author={Oluf Faroe and David Pisinger and Martin Zachariasen},
  journal={INFORMS J. Comput.},
  year={2003},
  volume={15},
  pages={267-283}
}
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… 

A Two-Level Tabu Search for the Three-dimensional Bin Packing Problem

Three-dimensional orthogonal bin packing is a problem NP-hard in the strong sense where a set of boxes must be orthogonally packed into the minimum number of three-dimensional bins. We present a

TS 2 PACK : A Two-Level Tabu Search for the Three-dimensional Bin Packing Problem

Three-dimensional orthogonal bin packing is a problem NP-hard in the strong sense where a set of boxes must be orthogonally packed into the minimum number of three-dimensional bins. We present a

TS 2 PACK : A Two-Level Tabu Search for the Three-dimensional Bin Packing Problem

Three-dimensional orthogonal bin packing is a problem NP-hard in the strong sense where a set of boxes must be orthogonally packed into the minimum number of three-dimensional bins. We present a

Sequence based heuristics for two-dimensional bin packing problems

This article addresses several variants of the two-dimensional bin packing problem. In the most basic version of the problem it is intended to pack a given number of rectangular items with given

Heuristic algorithms for the three-dimensional bin packing problem

A Hybrid CD/VND Algorithm for Three-Dimensional Bin Packing

The three-dimensional bin packing problem consists of packing a set of boxes into the minimum number of bins. This paper presents a new GRASP algorithm for solving three-dimensional bin packing

A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing

TLDR
The resulting hybrid GRASP/VND algorithm is simple and quite fast and the extensive computational results on test instances from the literature show that the quality of the solutions is equal to or better than that obtained by the best existing heuristic procedures.

A heuristic for solving large bin packing problems in two and three dimensions

TLDR
A straightforward heuristic is presented that is based on a method for the container loading problem following a wall-building approach and on a methods for the one-dimensional BPP, and 1,800 new benchmark instances are introduced for the two-dimensional and three- dimensional BPP.
...

References

SHOWING 1-10 OF 26 REFERENCES

The Three-Dimensional Bin Packing Problem

TLDR
An exact algorithm for filling a single bin is developed, leading to the definition of an exact branch-and-bound algorithm for the three-dimensional bin packing problem, which also incorporates original approximation algorithms.

Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems

TLDR
A new heuristic algorithm for each problem in the class of problems arising from all combinations of the above requirements, and a unified tabu search approach that is adapted to a specific problem by simply changing the heuristic used to explore the neighborhood.

Two-Dimensional Finite Bin-Packing Algorithms

TLDR
The heuristics presented in this paper are suitable for practical use, and behave in a manner which reflects the proven worst-case bounds for the two-dimensional open-ended bin-packing problem.

Approximation algorithms for the oriented two-dimensional bin packing problem

Packing Rectangular Pieces - A Heuristic Approach

TLDR
Approximation algorithms are given where the solutions are achieved with heuristic search methods and test results are presented to support the feasibility of the methods.

Exact Solution of the Two-Dimensional Finite Bon Packing Problem

TLDR
This work analyzes a well-known lower bound of the Two-Dimensional Finite Bin Packing Problem, and proposes not lower bounds which are used within a branch-and-bound algorithm for the exact solution of the problem.

Lower bounds and reduction procedures for the bin packing problem

An Algorithm for Two-Dimensional Cutting Problems

We present a tree-search algorithm for two-dimensional cutting problems in which there is a constraint on the maximum number of each type of piece that is to be produced. The algorithm limits the

On Packing Two-Dimensional Bins

TLDR
This work proposes a hybrid algorithm, based on algorithms for simpler bin packing problems, and shows that proof techniques developed for the simpler cases can be combined to prove close bounds on the worst case behavior of the new hybrid.

An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure

TLDR
A Lagrangean relaxation of a zero-one integer programming formulation of the problem of cutting a number of rectangular pieces from a single large rectangle is developed and used as a bound in a tree search procedure.