首页 | 本学科首页   官方微博 | 高级检索  
     

改进的蚁群算法在修磨轨迹优化中的应用
引用本文:武利生,权龙,杨付生. 改进的蚁群算法在修磨轨迹优化中的应用[J]. 计算机工程, 2009, 35(7): 195-197
作者姓名:武利生  权龙  杨付生
作者单位:1. 太原理工大学机械电子工程研究所,太原,030024
2. 太原申海机械设备有限公司,太原,030041
摘    要:提出一种适用于钢坯修磨轨迹优化问题的改进蚁群算法,给出一种修磨轨迹优化问题的实用数学模型。针对蚁群算法对参数敏感的问题,提出用启发信息归一化来解决的办法。仿真实验与初步试用结果表明,经改进蚁群算法优化的修磨轨迹能大幅度减少修磨过程中的空行程。该算法具有一定的理论参考价值和实际意义。

关 键 词:蚁群算法  钢坯修磨  轨迹优化
修稿时间: 

Application of Improved Ant Colony Algorithm in Grinding Path Optimization
WU Li-sheng,QUAN Long,YANG Fu-sheng. Application of Improved Ant Colony Algorithm in Grinding Path Optimization[J]. Computer Engineering, 2009, 35(7): 195-197
Authors:WU Li-sheng  QUAN Long  YANG Fu-sheng
Affiliation:1.Research Institute of Mechanical and Electronic Engineering;Taiyuan University of Technology;Taiyuan 030024;2.Taiyuan Shenhai Machinery Co.Ltd.;Taiyuan 030041
Abstract:An improved Ant Colony Algorithm(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.
Keywords:Ant Colony Algorithm(ACA)  steel grinding  path optimization
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号