.png){kind=icon}
返回
An effective placement method for the single container loading problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2016.05.008.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This study investigates a three-dimensional single container loading problem, which aims to pack a given set of unequal-size rectangular boxes into a single container such that the length of the occupied space in the container is minimized. Motivated by the practical logistics instances in literature, the problem under study is formulated as a zero-one mixed integer linear programming model. Due to the NP-hardness of the studied problem, a simple but effective loading placement heuristic is proposed for solving large-size instances. The experimental results demonstrate that the developed heuristic is capable of solving the instances with more than two hundred boxes and more efficient than the state-of-the-art mixed integer linear program and existing heuristic methods. (C) 2016 Elsevier Ltd. All rights reserved.
Keyword:
Container loading problem
Mixed integer linear program
Heuristic
Loading placement
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
Assessing Service Quality, Switching Costs and Customer Loyalty in Home-Delivery Services in Taiwan.png)
TRANSPORT REVIEWS
TRANSPORT REVIEWSIF9.9
PREAI
分享收藏A prototype column generation strategy for the multiple container loading problem多集装箱装载问题的原型列生成策略
PREAI
分享收藏分享收藏
查看更多内容