Algorithm 2D Irregular PDF
Algorithm 2D Irregular PDF
Abstract: The nesting problem involves arranging pieces on a plate to maximize use of material. A new scheme for 2D ir-
regular-shaped nesting problem is proposed. The new scheme is based on the NFP (No Fit Polygon) algorithm and a new
placement principle for pieces. The novel placement principle is to place a piece to the position with lowest gravity center based on
NFP. In addition, genetic algorithm (GA) is adopted to find an efficient nesting sequence. The proposed scheme can deal with
pieces with arbitrary rotation and containing region with holes, and achieves competitive results in experiment on benchmark
datasets.
Key words: Nesting, Cutting stock, No Fit Polygon (NFP), Genetic algorithm (GA), Lowest gravity center
doi:10.1631/jzus.2006.A0570 Document code: A CLC number: TP391.72
*
The procedure for irregular-shaped nesting
Project (No. 60573146) supported by the National Natural Science
Foundation of China mainly includes two steps: First, place the pieces into
Liu et al. / J Zhejiang Univ SCIENCE A 2006 7(4):570-576 571
NFP
Container Piece
Reference point