一类多旅行商路径均衡规划算法

A Kind of Multi-objective Traveling Salesman Problem Mission Planning Algorithm with Balanced Paths

本文研究了多个旅行商旅行多个城市的路径规划问题,提出了基于系统科学中的"吸引子"意义下的路径规划算法.路径规划的目标是均衡各旅行商的旅行路径长度并使得路径总和得到优化.为此提出了一种求解该问题的启发式算法思想,并结合邻近点和最短路径设计了算法,同时由复杂度分析知该算法的计算时间复杂度比以往的要低.

The paper presents a mission planning algorithm for Multi-objective traveling salesman problem with an objective to balance the length of traveling path and make the sum of path optimization. The travel mission involves several cities that need to be passed by traveling salesman. This algorithm is based upon the ＂attractors＂ of systems science. In this paper, combining with the neighboring points and the shortest path algorithm, we design a heuristic algorithm for solving the problem which balancing the length of traveling path and making the sum of path optimization. At the same time, the computation time complexity of the algorithm is lower than the past.