期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Algorithm for 2D irregular-shaped nesting problem based on the NFP algorithm and lowest-gravity-center principle 被引量:5
1
作者 LIU Hu-yao HE Yuan-jun 《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》 SCIE EI CAS CSCD 2006年第4期570-576,共7页
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 a... 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. 展开更多
关键词 NESTING Cutting stock No Fit polygon (NFP) Genetic algorithm (GA) Lowest gravity center
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部