| 基于蚁群算法的中国旅行商问题满意解 |
| |
| 引用本文： | 伍文城,肖建.基于蚁群算法的中国旅行商问题满意解[J].计算机与现代化,2002(8):6-8,11. |
| |
| 作者姓名： | 伍文城 肖建 |
| |
| 作者单位： | 西南交通大学电气工程学院,四川,成都,610031 |
| |
| 摘 要： | 蚁群算法是基于群体合作的一类仿生算法，适合于解困难的离散组合优化问题。本文对其做了适当的改进，以克服其求解速度过慢、容易出现停滞的缺陷，并将其用于解决中国旅行商问题。找到了目前巳知的最好的解，同时指出了进一步提高蚁群算法效率还需解决的问题和方向。
|
| 关 键 词： | 蚁群算法 中国旅行商问题 满意解 模拟进化算法 组合优化 NP问题 |
| 文章编号： | 1006-2475(2002)08-0006-03 |
Satisfactory Solution of Chinese Travelling Salesman Problem Based on Ant Colony Algorithm |
| |
| WU Wen-cheng,XIAO Jian.Satisfactory Solution of Chinese Travelling Salesman Problem Based on Ant Colony Algorithm[J].Computer and Modernization,2002(8):6-8,11. |
| |
| Authors: | WU Wen-cheng XIAO Jian |
| |
| Abstract: | 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. |
| |
| Keywords: | simulated evolutionary algorithm ant colony algorithm travelling salesman problem combinatorial optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
