A Comparative Study of Metaheuristics Methods for Solving Traveling Salesman Problem

  • Agung Chandra Universitas Mercu Buana Jl. Raya Meruya Selatan no.1, Jakarta 11650 http://orcid.org/0000-0002-0338-1588
  • Aulia Naro Universitas Mercu Buana Jl. Raya Meruya Selatan no.1, Jakarta 11650

Abstract

Abstract— In this study, we compare 8 (eight) metaheuristics methods:  GA, SA, TS, ACO, PSO, ABC, EFOA, and A3 for solving traveling salesman problem (tsp) in 70 cities in Java island. The result shows ABC algorithm has the best value and the best average value The results are tested by statistical methods both ANOVA and Tukey test which show the data of distances is not the same for every methods of metaheuristics and 20 pairs are different in means between each pairs Keywords: Metaheuristics Methods, TSP, ANOVA, Tukey test
Published
May 30, 2022
How to Cite
CHANDRA, Agung; NARO, Aulia. A Comparative Study of Metaheuristics Methods for Solving Traveling Salesman Problem. International Journal of Information Science and Technology, [S.l.], v. 6, n. 2, p. 1 - 7, may 2022. ISSN 2550-5114. Available at: <https://innove.org/ijist/index.php/ijist/article/view/211>. Date accessed: 01 feb. 2023. doi: http://dx.doi.org/10.57675/IMIST.PRSM/ijist-v6i2.211.
Section
Articles