Polygon Nesting Using Genetic Algorithm

作     者：Chen Chen~1 Chua Kim Huat~2 Wee Keng Hwee~3 (1.Sembcorp Marine Technology Pte.) (2.National Vniversity of Singapore.) (3.Sembcorp Marine Technology Pte.) 

出 版 物：《自动化博览》 (Automation Panorama1)

年 卷 期：2011年第28卷第S2期

页      面：43-48页

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 081104[工学-模式识别与智能系统] 08[工学] 0835[工学-软件工程] 0824[工学-船舶与海洋工程] 082401[工学-船舶与海洋结构物设计制造] 0811[工学-控制科学与工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported by Sembcorp Marine Technology Pte.Ltd 

主　　题：自动化 系统工程师 增刊 论文集 

摘      要：The nesting problem has been for many years a subject of interest to shipbuilders as continuously rising price of raw *** optimized steel plate cutting plan saves shipyard both time and material,improves production efficiency,and in return enhances the company’s competition *** this paper,the author will propose a polygon nesting method using bottom left strategy with genetic *** algorithm allows parts to be nested within several steel plates which have fixed sizes by searching a suitable accommodate node among the intersection points of the no-fit polygons of previously placed parts relative to the new part following a bottom left *** verify this algorithm using a rectangular nesting problem from published *** then give more computational experiments on polygon nesting problems.