基于小生境遗传算法的矩形件优化排样  

Optimal Layout of Rectangular Parts Based on Niche Genetic Algorithm

作　　者：李明[1,2] 黄平捷[1] 周泽魁[1] 

机构地区：[1]浙江大学控制科学与工程系,浙江杭州310027 [2]浙江省计量科学研究院,浙江杭州310007

出　　处：《湖南大学学报（自然科学版）》2009年第1期46-49,共4页Journal of Hunan University:Natural Sciences

基　　金：国家自然科学基金资助项目(50505045)

摘　　要：将小生境遗传算法应用于计算机辅助排样领域,提出了一种改进的解码算法——高度调整法,将高度调整法和小生境遗传算法相结合,用于求解矩形件排样问题.该方法首先将矩形件的排样问题转化为便于优化求解的排列问题,然后应用小生境遗传算法的全局优化概率搜索能力进行优化求解,优化计算过程中应用高度调整法将排样序列转化为排样图.用该算法对文献中的两个算例进行了求解,结果表明该算法是行之有效的.In order to achieve the optimal layout of rectangular parts with dynamic constraints, a new rectangular optimal layout method was proposed based on a new decoding algorithm-Height Adjustment algorithm （HAA） and niche genetic algorithm （NGA）. The problem of rectangular optimal layout could be translated into optimization problem in the field of permutation problem, and then the NGA was used to search the solution space efficiently in order to find the optimal solution of the layout. The new decoding algorithm-HAA was used to decode the permutation of the rectangles to packing pattern during the procedure of optimization. The feasibility of the proposed method was demonstrated with two numerical examples.

关 键 词：矩形件 优化排样 高度调整法 遗传算法 小生境 

分 类 号：TP391.72[自动化与计算机技术—计算机应用技术] TH162[自动化与计算机技术—计算机科学与技术]