期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 141, 期 2, 页码 393-409出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/S0377-2217(02)00133-9
关键词
packing; container; tree search; stability; weight distribution
In order to solve heterogeneous single and multiple container loading problems, an algorithm is presented that builds homogeneous blocks of identically orientated items. First a greedy heuristic is presented that generates the desired block arrangements. Second the solutions provided by the greedy heuristic are improved by a tree search. Additional aspects such as load stability and weight distribution within the container are also taken into account. The test cases of Bischoff and Ratcliff are used for benchmarking purposes. (C) 2002 Elsevier Science B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据