Research on MTSP Problem based on Simulated Annealing

Multiple Traveling Salesman Problem (MTSP) is the extension of Traveling Salesman Problem (TSP). In reality, lots of problems are similar with MTSP, for example, Last-mile Express Deliver Problem can be viewed as a MTSP which takes time as optimal objective, Vehicle Routing Problem (VRP) can be viewed as MTSP which takes distance as optimal objective, travel routes planning problem can be viewed as a MTSP which takes time or expense as the objective. So in this paper, we focus on a kind of MTSP that takes time as only optimal objective to build the model, and we solve it by using Simulated Annealing Algorithm (SA). Also we analyse the performance of SA in different parameters. The algorithm is realized under MATLAB environment.