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

被引：67

作者：

Parreno, F. ^{[2
]}

Alvarez-Valdes, R. ^{[1
]}

Oliveira, J. F. ^{[3
,4
]}

Tamarit, J. M. ^{[1
]}

机构：

[1] Univ Valencia, Dept Stat & Operat Res, Valencia, Spain

[2] Univ Castilla La Mancha, Dept Math, Albacete, Spain

[3] Univ Porto, Fac Engn, P-4100 Oporto, Portugal

[4] INESC, Oporto, Portugal

来源：

ANNALS OF OPERATIONS RESEARCH | 2010年 / 179卷 / 01期

关键词：

Cutting; Packing; Heuristic algorithms; GRASP; VND; LOWER BOUNDS; SEARCH; LIBRARY;

D O I：

10.1007/s10479-008-0449-4

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

The three-dimensional bin packing problem consists of packing a set of boxes into the minimum number of bins. In this paper we propose a new GRASP algorithm for solving three-dimensional bin packing problems which can also be directly applied to the two-dimensional case. The constructive phase is based on a maximal-space heuristic developed for the container loading problem. In the improvement phase, several new moves are designed and combined in a VND structure. 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.

引用

页码：203 / 220

页数：18

共 32 条

[1]

BEASLEY JE, 1985, J OPER RES SOC, V36, P297

[2] AN EXACT TWO-DIMENSIONAL NON-GUILLOTINE CUTTING TREE-SEARCH PROCEDURE [J].