改进的蚁群算法在修磨轨迹优化中的应用  

Application of Improved Ant Colony Algorithm in Grinding Path Optimization

作　　者：武利生[1] 权龙[1] 杨付生 

机构地区：[1]太原理工大学机械电子工程研究所,太原030024 [2]太原申海机械设备有限公司,太原030041

出　　处：《计算机工程》2009年第7期195-197,共3页Computer Engineering

摘　　要：提出一种适用于钢坯修磨轨迹优化问题的改进蚁群算法,给出一种修磨轨迹优化问题的实用数学模型。针对蚁群算法对参数敏感的问题,提出用启发信息归一化来解决的办法。仿真实验与初步试用结果表明,经改进蚁群算法优化的修磨轨迹能大幅度减少修磨过程中的空行程。该算法具有一定的理论参考价值和实际意义。An improved Ant Colony Atgorithm（ACA） is presented that can be used to search shortest grinding path for the grinding machine and the grinding path optimization mathematical model is given. The attractiveness normalization is introduced and adopted to decrease the optimization result＇s dependence on the parameters selected in the basic model ant colony algorithm. Simulation experiment and application show that the location path is shortened greatly after the path is optimized by ant colony algorithm.

关 键 词：蚁群算法 钢坯修磨 轨迹优化 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]