.png){kind=icon}
返回
Mathematical models for multicontainer loading problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.omega.2016.02.002.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper deals with the problem of a distribution company that has to serve its customers by putting first the products on pallets and then loading the pallets onto trucks. We approach the problem by developing and solving integer linear models. We start with basic models, that include the essential features of the problem, such as respecting the dimensions of the truck, and not exceeding the total weight capacity and the maximum weigh capacity on each axle. Then, we add progressively new conditions to consider the weight and volume of pallet bases and to include other desirable features for the solutions to be useful in practice, such as the position of the center of gravity and the minimization of the number of pallets. The models have been tested on a large set of real instances involving up to 46 trucks and kindly provided to us by a distribution company. The results show that in most cases the optimal solution can be obtained in small running times. Moreover, when optimality cannot be proven, the gap is very small, so we obtain high quality solutions for all the instances that we tested. (C) 2016 Elsevier Ltd. All rights reserved.
Keyword:
Containers
Integer programming
Optimization
Cutting stock problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
O
IF:
7.2
论文数:
3.7K
被引数:
1.4W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容