Abstract: This paper firstly proposes uncertain TSP model. This model assumes the distances as dynamic. 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.

Key words: uncertain programming, uncertain traveling salesman problem, ant algorithm

摘要： 本文首次提出了不确定TSP问题模型。此模型将路径长度看作动态可变的。本文同时提出了一种基于蚂蚁算法的混合方法求解并提出了不确定TSP问题解的评价标准。实验结果显示，该方法能够加速蚂蚁算法的收敛性，可以有效求解不确定TSP问题。

关键词: 不确定规划, 不确定TSP问题, 蚂蚁算法