摘要
蚁群算法是模拟蚁群寻找最短路径时的交互过程的一种算法,是受蚂蚁的行为启发而发展出来,已经广泛应用于组合优化问题的求解等方面问题,但其收敛速度一直是该领域讨论的热点问题。本文结合著名的ACS算法,提出一种基于多样化个体的蚁群系统算法ACS-DI,通过TSP对其进行验证。实验证明,此算法增强了搜索能力及收敛速度。
Ant colony algorithm is an interaction algorithm inspired by simulating ants finding the shortest path. It has been widely used to solve combinatorial optimization problems and other issues, but its convergence rate has been hot issue of discussion in the field. This paper, based on the ACS algorithm, presents an ant colony system algorithm （ACS-DI） and verifies it by the TSP. Experiments indicate that it has enhanced search capabilities and convergence speed.
出处
《信息化研究》
2011年第6期41-44,共4页
INFORMATIZATION RESEARCH
关键词
蚁群算法
旅行商问题
收敛速度
ant colony algorithm
travelling salesman problem
convergence rate
