| 基于遗传算法的轮廓切割顺序受限路径优化 |
| |
| 引用本文： | 徐建明,林示麟,董辉,俞立.基于遗传算法的轮廓切割顺序受限路径优化[J].控制工程,2011,18(5):767-770. |
| |
| 作者姓名： | 徐建明 林示麟 董辉 俞立 |
| |
| 作者单位： | 浙江工业大学信息工程学院,浙江杭州,310032 |
| |
| 基金项目： | 国家杰出青年科学基金资助项目(60525304); 浙江省科技重大专项(2007C11090) |
| |
| 摘 要： | 考虑一类轮廓切割顺序受限的加工路径优化问题.遵循由内到外的轮廓切割约束条件,以遍历所有待切割轮廓且刀头在轮廓问移动的空行程距离最短为优化目标,把约束条件转化到遗传算法编码问题采用启发式搜索技术以加快遗传算法的爬山速度,并且能自适应调整交叉和变异概率.实际应用结果表明所提算法能有效缩短空行程.
|
| 关 键 词： | 路径优化 遗传算法 启发式搜索 轮廓切割 |
Tool-Path Optimization with the Limited Contour Cutting Sequence Based on Genetic Algorithms |
| |
| XV Jian-ming,LIN Shi-lin,DONG Hui,YU Li.Tool-Path Optimization with the Limited Contour Cutting Sequence Based on Genetic Algorithms[J].Control Engineering of China,2011,18(5):767-770. |
| |
| Authors: | XV Jian-ming LIN Shi-lin DONG Hui YU Li |
| |
| Affiliation: | XV Jian-ming,LIN Shi-lin,DONG Hui,YU Li(College of Information Engineering,Zhejiang University of Technology,Hangzhou 310032,China) |
| |
| Abstract: | A class of tool-path optimization problem with the limited contour cutting sequence is considered.Obeyed the condition that contours should be cut form inner to outer layer,the genetic algorithm(GA) is used with changing the limited condition to GA encoding for the purpose of finding a minimum non-cutting path tour passing through one node from each cluster.An effective heuristic search technique is used to add a great deal of power to GA,and the probability of crossover and mutation can be adaptively adjus... |
| |
| Keywords: | tool-path optimization genetic algorithm heuristic search contour cutting |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
