返回
Exact methods for three-dimensional cutting and packing: A comparative study concerning single container problems
DOI:10.1016/j.cor.2019.04.020.png)
摘要
En 中文
Three-dimensional Cutting and Packing Problems consist of a set of items that must be placed inside one or more larger items (containers). Such problems enforce non-overlapping constraints which ensure that the smaller items being assigned must completely fit inside their respective container. Despite extensive preexisting literature, there is the distinct absence of a study comparing exact methods for three-dimensional Cutting and Packing Problems. Therefore, the primary ambition of the present research is to provide a comparative study of the most significant exact methods which have been designed for two variants of this problem class: the Single Large Object Placement Problem and the Single Knapsack Problem. By adapting the selected methods in accordance with the problems being analyzed, a detailed comparison is possible via experimentation using classic benchmarks datasets and newly-generated instances using a Cutting and Packing Generator from the literature. Over 15,000 h of experiments provide information concerning which methods perform best for the considered problems in addition to the scaling behavior and influence of the percentage of the larger item occupancy for each of the tested methods. These results provide further insight concerning performance improvements of existing exact methods and the development of new formulations. (C) 2019 Elsevier Ltd. All rights reserved.
Keyword:
3D Cutting and packing
Exact methods
Comparative study
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Three-dimensional container loading models with cargo stability and load bearing constraints具有货物稳定性和承载约束的三维集装箱装载模型

