Article: Optimisation of multiple travelling salesman problem using metaheuristic methods Journal: International Journal of Enterprise Network Management (IJENM) 2022 Vol.13 No.3 pp.199 - 215 Abstract: The problem of travelling salesmen (TSP) is a well-known task in the field of combinatorial optimisation. However, the problem of the multiple travelling salesman (mTSP), which extends the former, is a more challenging and complex combinatorial optimisation problem. This problem included addressing real-world issues where more than one salesman needed to be responsible for. This paper covered the use of heuristic approaches to tackle 180 cities and six travelling salesmen to reduce the path distances. To transform an mTSP into a TSP, a K-means clustering algorithm was used. Genetic algorithm (GA) was applied to the cluster after the clustering was done and iterated to provide the best possible value for distance following convergence. Now, with the ant colony optimisation (ACO) algorithm, every cluster was once again solved to determine the optimum distance value as a TSP. Once the two heuristic methods were applied, it became evident that due to the thorough analysis and constructive design of the algorithm, the ant colony optimisation algorithm yielded better results and more efficient tour than the genetic algorithm. Inderscience Publishers - linking academia, business and industry through research

Title: Optimisation of multiple travelling salesman problem using metaheuristic methods

Authors: R. Dhanalakshmi; P. Parthiban; N. Anbuchezhian

Addresses: Department of Computer Science and Engineering, Indian Institute of Information Technology Tiruchirappalli, Tiruchirappalli, 620015, Tamil Nadu, India ' Department of Production Engineering, National Institute of Technology, Tiruchirappalli, 620015, Tamil Nadu, India ' Department of Mechanical Engineering, R.M.D. Engineering College, Kavaraipettai, 601206, India

Abstract: The problem of travelling salesmen (TSP) is a well-known task in the field of combinatorial optimisation. However, the problem of the multiple travelling salesman (mTSP), which extends the former, is a more challenging and complex combinatorial optimisation problem. This problem included addressing real-world issues where more than one salesman needed to be responsible for. This paper covered the use of heuristic approaches to tackle 180 cities and six travelling salesmen to reduce the path distances. To transform an mTSP into a TSP, a K-means clustering algorithm was used. Genetic algorithm (GA) was applied to the cluster after the clustering was done and iterated to provide the best possible value for distance following convergence. Now, with the ant colony optimisation (ACO) algorithm, every cluster was once again solved to determine the optimum distance value as a TSP. Once the two heuristic methods were applied, it became evident that due to the thorough analysis and constructive design of the algorithm, the ant colony optimisation algorithm yielded better results and more efficient tour than the genetic algorithm.

Keywords: ant colony optimisation; ACO; genetic algorithm; k-means cluster algorithm; multiple travelling salesman problem; mTSP.

DOI: 10.1504/IJENM.2022.10050731

International Journal of Enterprise Network Management, 2022 Vol.13 No.3, pp.199 - 215

Accepted: 02 Sep 2020
Published online: 29 Sep 2022 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article

Title: Optimisation of multiple travelling salesman problem using metaheuristic methods

Keep up-to-date