本文已被:浏览 2007次 下载 4496次
Received:February 16, 2012 Revised:March 14, 2012
Received:February 16, 2012 Revised:March 14, 2012
中文摘要: 针对基本蚁群算法存在求解速度慢,容易出现“早熟”, 导致搜索停滞的缺点, 将遗传算法中排序的概念扩展到精英机制当中, 以一种新的加权方法进行信息素更新, 建立了改进蚁群算法模型. 对30 城市物流配送问题仿真结果表明: 改进算法的求解速度和求解精确度都明显优于基本蚁群算法.
Abstract:The basic ant colony algorithm converges slowly, is prone to plunge into partial optimum and results in search stagnation. In this paper, the optimized compositor is introduced into elitist strategy. According to ant compositor, new weighted coefficient is designed for pheromone updating. The simulation results of 30-city logistic distribution show that improved algorithm is more efficient and accurate than the basic ant colony algorithm.
keywords: ant colony algorithm(ACA) search stagnation elitist strategy compositor logistic distribution
文章编号: 中图分类号: 文献标志码:
基金项目:国家自然科学基金(50904032)
引用文本:
张家善,王志宏,陈应显.一种基于精英策略的改进蚁群算法及应用.计算机系统应用,2012,21(10):105-108,134
ZHANG Jia-Shan,WANG Zhi-Hong,CHEN Ying-Xian.Improved Ant Colony Algorithm Based on Elitist Strategy and Application.COMPUTER SYSTEMS APPLICATIONS,2012,21(10):105-108,134
张家善,王志宏,陈应显.一种基于精英策略的改进蚁群算法及应用.计算机系统应用,2012,21(10):105-108,134
ZHANG Jia-Shan,WANG Zhi-Hong,CHEN Ying-Xian.Improved Ant Colony Algorithm Based on Elitist Strategy and Application.COMPUTER SYSTEMS APPLICATIONS,2012,21(10):105-108,134