摘要
在蚂蚁算法基本原理的基础上,通过引入蚁群更新、沿途搜索等策略,对算法进行了改进.用C语言设计了蚂蚁算法程序,通过典型优化设计问题进行了验证,并给出了机械优化设计实例.实例表明,改进后的蚂蚁算法全局收敛能力强,程序运行可靠.
The basic ant colony optimization algorithm was improved by introducing rebirth of ant colony and searches on the way. A program of improved ant colony algorithm, named as Antalg, was designed with the language of C. The reliability of Antalg has been validated with typical optimization problems. An example of mechanical optimal design was given. The improved ant colony algorithm has good convergence, and Antalg runs reliably.
出处
《湖南文理学院学报（自然科学版）》
CAS
2005年第3期50-52,共3页
Journal of Hunan University of Arts and Science(Science and Technology)
基金
湖南省教育科学研究重点项目(03A031)
关键词
蚂蚁算法
改进
机械设计
优化设计
ant colony algorithm
improvement
optimization design
mechanical design
