.png){kind=icon}
返回
A hybrid genetic algorithm for the container loading problem
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(00)00055-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
packing
container loading problem
three-dimensional knapsack problem
genetic algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
分享收藏
Host habitat patchiness and the distance decay of similarity among gastro-intestinal nematode communities in two species of Mastomys (southeastern Senegal).png)
Oecologia
OAAI
OecologiaIF0
OAAI分享收藏分享收藏
查看更多内容