摘要
为提高束流加工效率,需对切割路径进行优化。切割路径优化与一般的旅行商问题(TSP)不同,需要保证每个轮廓中的各个点在优化后顺序连接。采用增加节点的方法把切割路径优化问题变换为经典旅行商问题,简化问题的求解。运用遗传算法求解简化后的旅行商问题,再把优化解变换为切割路径优化问题的解,用于指导束流加工中的路径规划。试验表明,这种方法是有效的。
It is a basically problem to optimize the cutting paths for increasing the efficiency of high power beam cutting. The optimization of cutting paths is different from the traditional traveling salesman problem （TSP） on the limitation that a local circle in cutting paths should be cut in a certain order. A transformation method for optimization problem of cutting paths to TSP was introduced to solve this problem, and the TSP was solved by genetic algorithm. The optimum results for the TSP can be transformed back to the solution for optimization of cutting paths. The numerical simulated results show that this method is effective on optimization of high power beam cutting paths.
出处
《农业机械学报》
EI
CAS
CSCD
北大核心
2008年第9期158-160,165,共4页
Transactions of the Chinese Society for Agricultural Machinery
基金
浙江省自然科学基金资助项目(项目编号:Y104007)
关键词
路径优化
束流切割
旅行商问题
遗传算法
Optimization of cutting paths, High power beam cutting, Traveling salesman problem, Genetic algorithm
