节点文献
求解不确定TSP问题的蚂蚁算法
Solving uncertain TSP problem using ant algorithm
【摘要】 提出了不确定旅行商问题模型,该模型将路径长度看作动态可变的。从实际应用来说,该模型考虑了交通运行中的不确定情况,比经典旅行商问题更具有灵活性及实用价值,利用该模型得到的结果将更适于指导车辆对运行路线的选择。同时提出了一种基于蚂蚁算法的混合方法求解不确定旅行商问题,并给出了解的评价标准。实验结果显示,该方法能够加速蚂蚁算法的收敛性,可以有效求解不确定旅行商问题。
【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.
【Key words】 uncertain programming; uncertain traveling salesman problem; ant algorithm;
- 【文献出处】 计算机工程与应用 ,Computer Engineering and Applications , 编辑部邮箱 ,2007年03期
- 【分类号】TP18
- 【被引频次】9
- 【下载频次】384