Research on multi-traveling salesman problem based on simulated annealing algorithm

• Published in: 2022 International Conference on Computers, Information Processing and Advanced Education (CIPAE) pp. 390 - 393
• Main Authors: Xia, Wenming, Li, Guofu, Zeng, Yuyan
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.08.2022
• Subjects: Mathematical models; multi-travel agent problem; Path balancing; Real-time systems; Simulated annealing; Simulation; Time window; Traveling salesman problems; Urban areas; Vehicle routing
• DOI: 10.1109/CIPAE55637.2022.00088

As an extension of the traveling salesman problem, the multi-traveling salesman problem is also a typical NP hard problem, but it has wider practical significance. In the past, most of the research on solving the multi-travel salesman problem was limited to the minimum sum of all travel salesman paths as the optimization standard. In this paper, based on the constraints of the minimum travel quotient, the path balance among travel agents, and the time window traversing the city, a mathematical model was established to optimize the multi-travel salesman path using the improved simulated annealing algorithm. The feasibility of the algorithm is verified by a simulation example, and it meets the requirements of real-time performance.