期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 131, 期 1, 页码 143-161出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/S0377-2217(00)00055-2
关键词
packing; container loading problem; three-dimensional knapsack problem; genetic algorithm
This paper presents a hybrid genetic algorithm (GA) for the container loading problem with boxes of different sizes and a single container for loading. Generated stowage plans include several vertical layers each containing several boxes. Within the procedure, stowage plans are represented by complex data structures closely related to the problem. To generate offspring, specific genetic operators are used that are based on an integrated greedy heuristic. The process takes several practical constraints into account. Extensive test calculations including procedures from other authors vouch for the good performance of the GA, above all for problems with strongly heterogeneous boxes. (C) 2001 Elsevier Science B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据