6533b82efe1ef96bd1292623
RESEARCH PRODUCT
A GRASP/Path Relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
Ramón Alvarez-valdésJosé Manuel TamaritFrancisco Parreñosubject
Mathematical optimizationGeneral Computer ScienceBin packing problemGRASPPhase (waves)Management Science and Operations ResearchConstructiveBinSet (abstract data type)Modeling and SimulationPath (graph theory)HeuristicsAlgorithmMathematicsdescription
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.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2013-12-01 | Computers & Operations Research |