A GRASP/Path Relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems

Authors:
R. Alvarez-Valdes;F. Parreño;J. M. Tamarit
Affiliations:
University of Valencia, Department of Statistics and Operations Research, Burjassot, Valencia, Spain;University of Castilla-La Mancha, Department of Mathematics, Albacete, Spain;University of Valencia, Department of Statistics and Operations Research, Burjassot, Valencia, Spain
Venue:
Computers and Operations Research
Year:
2013

Citing 15
Cited 0

Variable sized bin packing

SIAM Journal on Computing
Exact Solution of the Two-Dimensional Finite Bon Packing Problem

Management Science
Tabu Search

Tabu Search
Grasp and Path Relinking for 2-Layer Straight Line Crossing Minimization

INFORMS Journal on Computing
The Three-Dimensional Bin Packing Problem

Operations Research
Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment

INFORMS Journal on Computing
Scatter Search: Methodology and Implementations in C

Scatter Search: Methodology and Implementations in C
A Hybrid Heuristic for the p-Median Problem

Journal of Heuristics
A General Purpose Algorithm for Three-Dimensional Packing

INFORMS Journal on Computing
Solving the variable size bin packing problem with discretized formulations

Computers and Operations Research
An APTAS for Generalized Cost Variable-Sized Bin Packing

SIAM Journal on Computing
GRASP and path relinking for the max-min diversity problem

Computers and Operations Research
Decision support for packing in warehouses

ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
The two-dimensional bin packing problem with variable bin sizes and costs

Discrete Optimization
A probabilistic heuristic for a computationally difficult set covering problem

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

The three-dimensional multiple bin-size bin packing problem, MBSBPP, is the problem of packing a set of boxes into a set of bins when several types of bins of different sizes and costs are available and the objective is to minimize the total cost of bins used for packing the boxes. First we propose a GRASP algorithm, including a constructive procedure, a postprocessing phase and some improvement moves. The best solutions obtained are then combined into a Path Relinking procedure for which we have developed three versions: static, dynamic and evolutionary. An extensive computational study, using two- and three-dimensional instances, shows the relative efficiency of the alternatives considered for each phase of the algorithm and the good performance of our algorithm compared with previously reported results.