.png){kind=icon}
返回
A hybrid differential evolution algorithm for multiple container loading problem with heterogeneous containers
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2015.10.007.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider a multiple container loading problem, commonly known as the three-dimensional bin packing problem (3D-BPP), which deals with maximizing container space utilization while the containers available for packing are heterogeneous, i.e., varying in size. The problem has wide applications in cargo transportation, warehouse management, medical packaging, and so on. We develop a differential evolution (DE) algorithm hybridized with a novel packing heuristic strategy, best-match-first (BMF), which generates a compact packing solution based on a given box packing sequence and a container loading sequence. The effectiveness of the proposed algorithm is evaluated on a set of industrial instances and randomly generated instances. The results show that the proposed algorithm outperforms existing solution approaches in terms of solution quality. (C) 2015 Elsevier Ltd. All rights reserved.
Keyword:
Three-dimensional bin packing (3D-BPP)
Differential evolution (DE)
Mathematical programming
Evolutionary algorithms (EAs)
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
分享收藏
A prototype column generation strategy for the multiple container loading problem多集装箱装载问题的原型列生成策略
PREAI
分享收藏
分享收藏分享收藏
查看更多内容