| 求解不确定TSP问题的蚂蚁算法 |
| |
| 引用本文： | 胡平,常晓宇,王康平,郭东伟,周春光.求解不确定TSP问题的蚂蚁算法[J].计算机工程与应用,2007,43(3):30-32. |
| |
| 作者姓名： | 胡平 常晓宇 王康平 郭东伟 周春光 |
| |
| 作者单位： | 吉林大学,计算机科学与技术学院,长春,130012 |
| |
| 基金项目： | 国家自然科学基金
,
教育部科学技术研究项目 |
| |
| 摘 要： | 提出了不确定旅行商问题模型,该模型将路径长度看作动态可变的。从实际应用来说,该模型考虑了交通运行中的不确定情况,比经典旅行商问题更具有灵活性及实用价值,利用该模型得到的结果将更适于指导车辆对运行路线的选择。同时提出了一种基于蚂蚁算法的混合方法求解不确定旅行商问题,并给出了解的评价标准。实验结果显示,该方法能够加速蚂蚁算法的收敛性,可以有效求解不确定旅行商问题。
|
| 关 键 词： | 不确定规划 不确定TSP问题 蚂蚁算法 |
| 文章编号： | 1002-8331（2007）03-0030-03 |
| 修稿时间： | 2006-09 |
Solving uncertain TSP problem using ant algorithm |
| |
| HU Ping,CHANG Xiao-yu,WANG Kang-ping,GUO Dong-Wei,ZHOU Chun-guang.Solving uncertain TSP problem using ant algorithm[J].Computer Engineering and Applications,2007,43(3):30-32. |
| |
| Authors: | HU Ping CHANG Xiao-yu WANG Kang-ping GUO Dong-Wei ZHOU Chun-guang |
| |
| Affiliation: | College of Computer Science and Technology,Jilin University,Changchun 130012,China |
| |
| Abstract: | This paper firstly proposes uncertain Traveling Salesman Problem(TSP) model.This model assumes the distances as dynamic.For application,this model considers the uncertain situations in the traffic system.Compared with the classical TSP problem,this model is more flexible and also has more application value.This mode is more properly for vehicle to choose the best route.This paper also proposes a hybrid approach which is based on ant system to solve the problem of uncertain TSP and the evalution criterion of the solution.Experiment results show that this approach can accelerate the convergence.So it is an effective approach to solve the uncertain TSP problem. |
| |
| Keywords: | uncertain programming uncertain traveling salesman problem ant algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
