| 用蚁群算法求解旅行商问题 |
| |
| 引用本文： | 高春涛.用蚁群算法求解旅行商问题[J].哈尔滨商业大学学报(自然科学版),2009,25(4):493-495. |
| |
| 作者姓名： | 高春涛 |
| |
| 作者单位： | 哈尔滨商业大学,基础科学学院,哈尔滨,150076 |
| |
| 摘 要： | 介绍了一种用于解决复杂优化问题的新的启发式算法--蚁群算法.阐述了该算法的基本原理、算法模型和在旅行商问题中的具体应用过程.研究表明该算法具有并行性,鲁棒性等优良性质.
|
| 关 键 词： | 蚁群算法 算法模型 旅行商问题 |
Study on solving traveling salesman problem by using ant colony algorithm |
| |
| GAO Chun-tao.Study on solving traveling salesman problem by using ant colony algorithm[J].Journal of Harbin University of Commerce :Natural Sciences Edition,2009,25(4):493-495. |
| |
| Authors: | GAO Chun-tao |
| |
| Institution: | School of Basic Science;Harbin University of Commerce;Harbin 150028;China |
| |
| Abstract: | Introduces a solution to the complex optimization problems for the new heuristic algorithm ant colony algorithm.The algorithm describes the basic principles of the model and algorithm in the traveling salesman problem in the specific application process.The results show that the parallel algorithm,robustness,such as the nature of the fine. |
| |
| Keywords: | ant colony algorithm algorithm model traveling salesman problem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
