Skip to main navigation Skip to search Skip to main content

Nesting of two-dimensional irregular parts: An integrated approach

  • The University of Auckland
  • University of Manitoba

Research output: Contribution to journalArticlepeer-review

25 Scopus citations

Abstract

The present paper reports an intelligent computer-aided nesting (CAN) system for optimal nesting of two-dimensional parts, especially parts with complicated shapes, with the objective of effectively improving the utilization ratio of sheet materials. This paper also systemically reviews the nesting algorithms that were developed to perform various nesting tasks, and attacks the irregular part nesting problem by efficiently integrating and improving the performance of nesting algorithms such as the rectangular enclosure method, bottom-left nesting algorithms, heuristic algorithms and genetic algorithms. The CAN system has also been developed as a nesting algorithm test platform for researching and developing new nesting algorithms. Through this test platform, the limitations of existing nesting algorithms are investigated and problems such as nesting parts in spaces within a single part or between parts are also studied. Efforts have been devoted to improving the nesting efficiency of the existing algorithms and developing new nesting algorithms. Case studies are carried out in a sheet metal cutting company. The results show that the intelligent CAN system can effectively nest both regular and irregular parts, and greatly improve the utilization ratio of raw sheet material.

Original languageEnglish
Pages (from-to)741-756
Number of pages16
JournalInternational Journal of Computer Integrated Manufacturing
Volume20
Issue number8
DOIs
StatePublished - Dec 2007
Externally publishedYes

Keywords

  • Heuristic algorithms
  • Irregular parts
  • Nesting algorithms
  • No fit polygon (NFP)

Fingerprint

Dive into the research topics of 'Nesting of two-dimensional irregular parts: An integrated approach'. Together they form a unique fingerprint.

Cite this