Optimisation of multiple travelling salesman problem using metaheuristic methods Online publication date: Thu, 29-Sep-2022
by R. Dhanalakshmi; P. Parthiban; N. Anbuchezhian
International Journal of Enterprise Network Management (IJENM), Vol. 13, No. 3, 2022
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.
Online publication date: Thu, 29-Sep-2022
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Enterprise Network Management (IJENM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org