.png){kind=icon}
返回
A pairwise exact placement algorithm for the irregular nesting problem
.png){kind=icon}
PRE
AI
DOI：10.1080/0951192X.2015.1033018.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The irregular nesting problem, a subset of cutting and packing problems, aims to minimise waste or unoccupied space inside a container and is found in wood, glass, shipbuilding and textile industries. The problem consists in finding the most compact arrangement of two-dimensional items inside a rectangular container without overlap. The length of the container is variable and up to four different orientations are allowed for each item. Overlap is avoided by using a constructive placement heuristic which places items one at a time, without colliding with other items. The proposed algorithm in this work uses a pairwise placement strategy in which one item is always positioned in exact fitting or sliding placements, which are positions where the item movement is restricted. A simulated annealing algorithm controls the placement sequence and guides the search over the solution space. Several placement heuristics were proposed and tests were conducted with benchmark instances. Results show improvement in efficiency and speed over previous works in some cases.
Keyword:
nesting problems
irregular items
collision-free region
no-fit polygon
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
4
论文数:
2.3K
被引数:
3.4K
机构
引用论文
.png){kind=icon}
Solving Irregular Strip Packing problems by hybridising simulated annealing and linear programming
PREAI
分享收藏
查看更多内容