A Kind of Multi-objective Traveling Salesman Problem Mission Planning Algorithm with Balanced Paths
Liu Shui-qiang · Journal of Shaoyang University · 2010
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.