基于遗传算法的切割路径优化  

Optimization of Cutting Path Based on Genetic Algorithm

作　　者：高伟增[1] 张宝剑[1] 陈付贵[1] 朱家义[1] 

机构地区：[1]河南科技学院计算机科学系,河南新乡453000

出　　处：《西南交通大学学报》2005年第4期457-461,共5页Journal of Southwest Jiaotong University

基　　金：河南科技学院校青年基金资助的重点项目(02120).

摘　　要：将遗传算法用于求解加工路径优化问题.针对加工路径优化目标,即零件加工轨迹应走过零件所有内外轮廓且路径最短,给出了非确定型的多项式数学模型,并根据优化目标将其简化为点与点之间的优化.用遗传算法对加工路径优化进行了遗传编码,并对75个零件排样进行了计算机仿真计算.仿真结果显示,最优值(37129mm)为初始值(43622mm)的85%,表明该算法可行.Genetic algorithm was applied to optimize cutting path. Aimed at the optimization objective, i. e., a processing path should include every outline in each part and has the shortest distance, a nondeterministic polynomial cost function was designed and simplified to the optimization among points. In addition, a genetic encoding was given, and nesting parts including 75 parts were simulated numerically. The simulation results show that the optimal length 37129 mm of cutting path is 85 % of the original length 43622 mm so as to prove the validity of the proposed algorithm.

关 键 词：进化计算 遗传算法 遗传编码 路径优化 计算机仿真计算 切割 加工路径 优化目标 优化问题 加工轨迹 

分 类 号：O242.23[理学—计算数学] TG485[理学—数学]