摘要
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.
The nesting problem involves arranging pieces on a plate to maximize use of material. A new scheme for 2D irregular-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.
基金
Project (No. 60573146) supported by the National Natural ScienceFoundation of China
关键词
嵌套
遗传算法
最低重心
NFP
Nesting
Cutting stock
No Fit Polygon （NFP）
Genetic algorithm （GA）
Lowest gravity center
