Solving Random Travelling Salesman Problem using Firefly Algorithm
Nitesh M Sureja
Dr. Nitesh M Sureja*, Department of Computer Engineering OM Engineering College, Junagadh, India.
Manuscript received on January 10, 2020. | Revised Manuscript received on January 20, 2020. | Manuscript published on February 10, 2020. | PP: 1037-1041 | Volume-9 Issue-4, February 2020. | Retrieval Number: C9113019320/2020©BEIESP | DOI: 10.35940/ijitee.C9113.029420
Open Access | Ethics and Policies | Cite | Mendeley
© 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: The firefly algorithm is a recently developed optimization algorithm, which is suitable for solving any kind of discrete optimization problems. This is an algorithm inspired from the nature. In this paper, a firefly algorithm is proposed to solve random traveling salesman problem. The solution to this problem is already proposed by the algorithms like simulated annealing, genetic algorithms and ant colony algorithms. This algorithm is developed to deal with the issue of accuracy and convergence rate in the solutions provided by those algorithms. A comparison of the results produced by proposed algorithm with the results of simulated annealing, genetic algorithms and ant colony algorithm is given. Finally, the effectiveness of the proposed algorithm is discussed.
Keywords: Firefly Algorithm, Optimization, Random Traveling Salesman, Nature Inspired Algorithm
Scope of the Article: Approximation And Randomized Algorithms