.png){kind=icon}
返回
A Large Neighbourhood Search Algorithm for Solving Container Loading Problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2023.106199.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a Large Neighbourhood Search (LNS) algorithm that finds an effective packing of a set of items into containers. The aim of the LNS algorithm is to provide packing solutions that can be adopted by many logistics companies. The LNS algorithm can handle a set of side constraints such as orientation, stacking, and separation as well as weight limit, loading priorities, and stability to address the issues arising for loading the items. The packing solution is also visualised and animated using an Excel workbook to help the workers for loading of the items. Finally, the authors present a comparison between the performance of the LNS algorithm and the state-of-the-art algorithms from the literature based on benchmark data sets. The results demonstrate the quality of the solutions achieved by the LNS algorithm.
Keyword:
Container loading problem
Large neighbourhood search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
A prototype column generation strategy for the multiple container loading problem多集装箱装载问题的原型列生成策略
PREAI
分享收藏
查看更多内容