The Genetic Algorithm Solving the MTSP which Path May be Part-iterative
Hong Li · 2000
In a connected graph G, the travelling salesman problem that salesman can go back a part of the path he traveled is studied, the existence of the problem result is proved and the result getting method using the shortest path between vertices of G to construct a completeness graph is given. The multiple travelling salesmen problem, which path may be part iterative, is discussed and its solution algorithm is given, the solution algorithm uses the “divide and rule” method combined with the genetic algorithm. The problems about the shortest time or shortest path of the multiple salesmen to finish their travelling tasks and how to configure the travelling tasks to salesmen in a limited travelling time are discussed. The importance to study the multiple travelling salesmen problem, which path may be part iterative, is presented.