Improved genetic algorithm (VNS-GA) using polar coordinate classification for workload balanced multiple traveling salesman problem (mTSP)

english

2021

volume 16, issue 2

classification   genetic algorithm (GA)   multiple traveling salesman problem (mTSP)   polar coordinates   variable neighbourhood search algorithm (VNS)   workload balance

Univerza v Mariboru, Fakulteta za strojništvo
(Obvezni izvod spletne publikacije)

GThe multiple traveling salesman problem (mTSP) is an extension of the traveling salesman problem (TSP), which has wider applications in real life than the traveling salesman problem such as transportation and delivery, task allocation, etc. In this paper, an improved genetic algorithm (VNS-GA) that uses polar coordinate classification to generate the initial solutions is proposed. It integrates the variable neighbourhood algorithm to solve the multiple objective optimization of the mTSP with workload balance. Aiming to workload balance, the first design of this paper is about generating initial solutions based on the polar coordinate classification. Then a distance comparison insertion operator is designed as a neighbourhood action for allocating paths in a targeted manner. Finally, the neighbourhood descent process in the variable neighbourhood algorithm is fused into the genetic algorithm for the expansion of search space. The improved algorithm is tested on the TSPLIB standard data set and compared with other genetic algorithms. The results show that the improved genetic algorithm can increase computational efficiency and obtain a better solution for workload balance and this algorithm has wild applications in real life such as multiple robots task allocation, school bus routing problem and other optimization problems.

30.09.2026