Comparison of Algorithms for Solving Traveling Salesman Problem
Haider A Abdulkarim1, Ibrahim F Alshammari2
1Haider A Abdulkarim, Scholar (Assistant Lecturer), Computer Techniques Department, Al Israa University College, Baghdad, Iraq.
2Ibrahim F Alshammari, Scholar (Assistant Lecturer), Computer Techniques Department, Al Israa University College, Baghdad, Iraq.
Manuscript received on 15 August 2015 | Revised Manuscript received on 25 August 2015 | Manuscript Published on 30 August 2015 | PP: 76-79 | Volume-4 Issue-6, August 2015 | Retrieval Number: F4173084615/15©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Travel Salesman Problem is one of the most known optimization problems. While an optimal solution cannot be reached, non-optimal solutions approach optimality and keep running time fast. In this paper, the most used algorithms to solve this problem are comparedin terms of route length, elapsed time and number of iterations. The TSP is simulated using different scenarios examples and the convergence is checked for each case.
Keywords: TSP, Nearest Neighbor, Genetic Algorithm.
Scope of the Article: Algorithm Engineering