.png){kind=icon}
.png){kind=icon}
返回
The geometry of nesting problems: A tutorial
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2006.11.038.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Cutting and packing problems involving irregular shapes is an important problem variant with a wide variety of industrial applications. Despite its relevance to industry, research publications are relatively low when compared to other cutting and packing problems. One explanation offered is the perceived difficulty and substantial time investment of developing a geometric tool box to assess computer generated solutions. In this paper we set out to provide a tutorial covering the core geometric methodologies currently employed by researchers in cutting and packing of irregular shapes. The paper is not designed to be an exhaustive survey of the literature but instead will draw on the literature to illustrate the theory and implementation of the approaches. We aim to provide a sufficiently instructive description to equip new and current researchers in the area to select the most appropriate methodology for their needs. (C) 2007 Elsevier B.V. All rights reserved.
Keyword:
cutting
packing
geometry
optimisation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。