摘要
针对基本蚁群算法存在的过早收敛问题,提出一种采用混合模式调整信息素的改进蚁群算法,当陷入局部最优解时便启用新的信息素调整规则,从而使算法跳出局部解.计算机仿真结果表明,这种混合型蚁群算法对求解TSP难题有较好的改进效果.
A hybrid ant algorithm is presented to prevent the premature in canonical ant colony algorithm in this paper.The main idea of the meeting algorithm is that a hybrid pheromone update strategy is used according to the solution that artificial ants have found.Computer simulation shows that the proposed algorithm can efficiently find better minimum beyond premature convergence for hard TSP problem.
出处
《西北师范大学学报（自然科学版）》
CAS
2003年第4期31-34,共4页
Journal of Northwest Normal University(Natural Science)
关键词
蚁群算法
TSP
信息素
ant colony algorithm
TSP
pheromone
