摘要
针对基本蚁群算法存在求解速度慢,容易出现"早熟",导致搜索停滞的缺点,将遗传算法中排序的概念扩展到精英机制当中,以一种新的加权方法进行信息素更新,建立了改进蚁群算法模型.对30城市物流配送问题仿真结果表明:改进算法的求解速度和求解精确度都明显优于基本蚁群算法.
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.
出处
《计算机系统应用》
2012年第10期105-108,134,共5页
Computer Systems & Applications
基金
国家自然科学基金(50904032)
关键词
蚁群算法
搜索停滞
精英策略
排序
物流配送
ant colony algorithm（ACA）
search stagnation
elitist strategy
compositor
logistic distribution
