A Comparative Study of Metaheuristics Methods for Solving Traveling Salesman Problem
AbstractAbstract— 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
The submitting author warrants that the submission is original and that she/he is the author of the submission together with the named co-authors; to the extend the submission incorporates text passages, figures, data or other material from the work of others, the submitting author has obtained any necessary permission.
Articles in this journal are published under the Creative Commons Attribution Licence (CC-BY). This is to get more legal certainty about what readers can do with published articles, and thus a wider dissemination and archiving, which in turn makes publishing with this journal more valuable for you, the authors.
In order for iJIST to publish and disseminate research articles, we need publishing rights. This is determined by a publishing agreement between the author and iJIST.
By submitting an article the author grants to this journal the non-exclusive right to publish it. The author retains the copyright and the publishing rights for his article without any restrictions.
The names and email addresses entered in this journal site will be used exclusively for the stated purposes of this journal and will not be made available for any other purpose or to any other party.