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

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...

Full description

Saved in:
Bibliographic Details
Published in:Computers & operations research 2013-12, Vol.40 (12), p.3081-3090
Main Authors: Alvarez-Valdes, R., Parreño, F., Tamarit, J.M.
Format: Article
Language:English
Subjects:
Algorithms
Bin packing
Bins
Boxes (containers)
Construction costs
Cost reduction
Costs
Evolutionary
GRASP
Heuristic
Heuristics
Operations research
Packing problem
Path Relinking
Studies
Three dimensional
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2012.03.016