Improved Fireworks Algorithm for Solving and Addressing Multiple Traveling Salesman Problems
Qixin Liu, Fengqin Han · 2023
Aiming at the problem of non-initially specifying a fixed single starting point for the Multiple Travelling Salesman Problem and the longest path for a traveling salesman in a closed loop and the shortest total path, this paper combines the fireworks algorithm with the uniparental genetic algorithm, invokes the idea of uniparental genetic algorithm to improve the explosion strategy in the fireworks algorithm to increase the diversity of the population, draws on the strategy of the greedy algorithm to design a local search strategy with the variable neighborhood to improve the search capability of the algorithm, and finally, introduces the chaotic selection operator for the candidate set selection. Through experimental comparison, this paper's algorithm has certain advantages in solving the problem of addressing single-start multiple traveling salesman problems which verifies the effectiveness of this paper's algorithm.