Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Optimisation of multiple travelling salesman problem using metaheuristic methods

Optimisation of multiple travelling salesman problem using metaheuristic methods 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Enterprise Network Management Inderscience Publishers

Optimisation of multiple travelling salesman problem using metaheuristic methods

Download PDF
18 pages

Loading next page...
 
/lp/inderscience-publishers/optimisation-of-multiple-travelling-salesman-problem-using-fmwL5hDFsw

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Inderscience Publishers
Copyright
Copyright © Inderscience Enterprises Ltd
ISSN
1748-1252
eISSN
1748-1260
DOI
10.1504/ijenm.2022.125803
Publisher site
See Article on Publisher Site

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.

Journal

International Journal of Enterprise Network Management – Inderscience Publishers

Published: Jan 1, 2022

There are no references for this article.