计算机工程与应用2012，Vol.48Issue(23)：239-243,5.DOI:10.3778/j.issn.1002-8331.2012.23.052
蚁群算法求解带约束火焰切割路径优化问题
Ant colony algorithm for path optimization of NC flame cutting under thermal deformation constraint
摘要
Abstract
The path optimization for flame cutting has two primary objectives: shortening the cutting path and reducing the thermal error caused by improper path planning. Thermal deformation constraints are quantified by dynamically defining the pierce points set, which can be determined through position relations between parts. Dummy nodes are added in the distance matrix, the cutting path planning problem can be transformed to dynamic TSP. The method for expanding solution space under thermal deformation constraint and the strategy about bidirectional updating of trail pheromones is presented based on ant colony algorithm. Experimental results show that the scale of TSP is restricted efficiently and better solutions can be obtained. It is feasible to optimize the flame cutting path under thermal deformation constraint.关键词
热变形/打孔点/旅行商问题/蚁群优化Key words
thermal deformation/ pierce points/ Traveling Salesman Problem (TSP)/ ant colony optimization分类
信息技术与安全科学引用本文复制引用
王祥雒,范刚龙,杨春蕾..蚁群算法求解带约束火焰切割路径优化问题[J].计算机工程与应用,2012,48(23):239-243,5.基金项目
河南省科技攻关重点项目(No.102102210035). （No.102102210035）
