摘要
蚁群算法是基于群体合作的一类仿生算法 ,适合于解困难的离散组合优化问题。本文对其做了适当的改进 ,以克服其求解速度过慢、容易出现停滞的缺陷 ,并将其用于解决中国旅行商问题 ,找到了目前已知的最好的解 。
Ant colony algorithm is a novel simulated evolutionary algorithm based on group cooperation and can be applied to solve hard discrete combinatorial optimization problem. This paper gives a brief introduction on the ant colony algorithm and modifies it to solve the Chinese travelling salesman problem. Result shows that the performance of ant colony algorithm is improved and the present best solution is found. It also points out that the ant colony algorithm still has to be modified in many ways.
出处
《计算机与现代化》
2002年第8期6-8,11,共4页
Computer and Modernization
关键词
蚁群算法
中国旅行商问题
满意解
模拟进化算法
组合优化
NP问题
simulated evolutionary algorithm
ant colony algorithm
travelling salesman problem
combinatorial optimization
