| 蚂蚁算法在TSP问题求解的应用 |
| |
| 引用本文： | 崔之熠,王茂芝,刘国涛,朱怀朝.蚂蚁算法在TSP问题求解的应用[J].四川理工学院学报(自然科学版),2011,24(3):334-337. |
| |
| 作者姓名： | 崔之熠 王茂芝 刘国涛 朱怀朝 |
| |
| 作者单位： | 成都理工大学信息管理学院,成都610059;数学地质四川省高校重点实验室,成都610059 |
| |
| 基金项目： | 国家863计划重点课题项目 |
| |
| 摘 要： | 蚂蚁算法是目前解决大规模复杂问题比较有效的算法。同时TSP问题是经典的NP-C问题,已被广泛应用于在VLSI芯片设计、网络路由和车辆选路等领域,对TSP问题的求解的突破意味着大量NPC问题的求解可以迎刃而解,因而有着重要的实际价值和理论意义。文章系统地介绍了TSP问题,并在此基础上对蚂蚁算法求解TSP问题做了相关探讨。实验结果表明,蚂蚁算法对参数的初始值也具有敏感性,对于一个好的初始值的确定,需要建立在大量试验的基础上。
|
| 关 键 词： | 蚂蚁算法 TSP问题 参数 |
Application of Ant Colony Algorithm in TSP Problem Solving |
| |
| CUI Zhi-yi,WANG Mao-zhi,LIU Guo-tao,ZHU Huai-zhao.Application of Ant Colony Algorithm in TSP Problem Solving[J].Journal of Sichuan University of Science & Engineering:Natural Science Editton,2011,24(3):334-337. |
| |
| Authors: | CUI Zhi-yi WANG Mao-zhi LIU Guo-tao ZHU Huai-zhao |
| |
| Institution: | 1,2(1.Key Lab of Geomathematics of Sichuan Province,College of Information Management,Chengdu University of Technology,Chengdu 610059,China;2.Key Lab of Geomathematics of Sichuan Province,College of Information Management,Chengdu University of Technology,Chengdu 610059,China) |
| |
| Abstract: | Ant Colony Algorithm is the more effective algorithm in solving the complex problems of large-scale.At the same time,TSP is a classic problem of NP-C and has been widely used in VLSI chip design,network routing,vehicle routing and other fields,so a breakthrough in solving the problem means a large number of NPC problem can be solved,which has important practical value and theoretical significance.The experimental results indicate that Ant Colony Algorithm has the sensitivity for the initial value of parameters,a good initial value of parameters need to build on the basis of a large number of test. |
| |
| Keywords: | Ant Colony Algorithm TSP problem parameters |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
