.png){kind=icon}
返回
Heuristic algorithm for the container loading problem with multiple constraints
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2017.04.021.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper addresses the container loading problem with multiple constraints that occur at many manufacturing sites, such as furniture factories, appliances factories, and kitchenware factories. These factories receive daily orders with expiration dates, and each order consists of one or more items. On a particular day, certain orders expire, and the expiring orders must be handled (shipped) prior to the non-expiring ones. All of the items in an order must be placed in one container, and the volume of the container should be maximally utilized. A heuristic algorithm is proposed to standardize the packing of (order) items into a container. The algorithm chooses the expiring orders first before handling the non-expiring orders. In both steps, the algorithm first selects a collection of orders by considering a simulated annealing strategy and subsequently packs the collection of orders into the container via a tree graph search procedure. The validity of the algorithm is examined through experimental results using BR instances. (C) 2017 Elsevier Ltd. All rights reserved.
Keyword:
Packing
Container loading
Complete shipment constraint
Shipment priority
Simulated annealing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
分享收藏
A prototype column generation strategy for the multiple container loading problem多集装箱装载问题的原型列生成策略
PREAI
分享收藏
查看更多内容