期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 141, 期 2, 页码 410-420出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/S0377-2217(02)00134-0
关键词
cutting; packing; heuristic algorithms; tabu search
The Three-Dimensional Bin Packing Problem (3BP) consists of allocating, without overlapping, a given set of three-dimensional rectangular items to the minimum number of three-dimensional identical finite bins. The problem is NP-hard in the strong sense, and finds many industrial applications. We introduce a Tabu Search framework exploiting a new constructive heuristic for the evaluation of the neighborhood. Extensive computational results on standard benchmark instances show the effectiveness of the approach with respect to exact and heuristic algorithms from the literature. (C) 2002 Elsevier Science B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据