You are here

Home » Content

Solving of Travelling Salesman Problem using Firefly Algorithm with Greedy Approach

Journal Name:

  • Cumhuriyet Üniversitesi Fen Fakültesi Fen Bilimleri Dergisi

Publication Year:

  • 2015

Key Words:

Author NameUniversity of Author
Abstract (2. Language): 
Travelling salesman problem is one of the most important problems in graphs theory which is considered as NP-hard problems. The important of this problem is due to the fact that it is used in many fields such as transportation, logistics, semiconductor industry, problem of routing, scan chain optimization and drilling problem in integrated orbit test, production and many others scientific and industrial fields. Till now various methods that have been used to solve this problem have their own advantage and disadvantage and problems, become clearer when the problem become harder. Therefore, travelling salesman problem remain as an open problem in research field of computer science. This paper tried to solve the above problem with an optimization algorithm with less complexity in order to solve this problem with firefly algorithm with greedy approach and it was compare and examined with other standard algorithm. The results show the superiority of proposed algorithm compared to the other used algorithm.
Bookmark/Search this post with
FULL TEXT (PDF): 
PDF icon 5000142870-5000238948-1-pb.pdf
  • 6
267
273
  • English

REFERENCES

References: 

[1] Nitesh, M. Sureja., Bharat V. Chawda : Memetic Algorithm a Metaheuristic Approach to
Solve RTSP, IJCSEITR, ISSN 2249-6831, Vol. 3, Issue 2, pp. 183-186, June 2013 .
[2] Saranya, s., Vaijayanthi, R. Priya : Traveling Salesman Problem Solved Using Bio Inspired
Algorithms (ABC), International Journal of Innovative Research in Computer and
Communication Engineering, Vol.2, Special Issue 1, March 2014.
[3] Kan, Jun-man., Zhang ,Yi : Application of an Improved Ant Colony Optimization on
Generalized Traveling Salesman Problem, Energy Procedia 17 ( 2012 ) 319 – 325.
SARAEI, ANALOUEI, MANSOURI
273
[4] Yan ,Xuesong., Zhang ,Can., Wenjing ,L., Wei ,L., Wei ,C., Hanmin ,L :An Solve Traveling
Salesman Problem Using Particle Swarm Optimization Algorithm, Vol. 9, Issue 6, No 2,
November 2012.
[5] Pathak ,N., Tiwari ,S : An Optimal Solution To Multiple Travelling Salesperson Problem
Using Modified Genetic Algorithm ,vol.3,issue1, January 2014.
[6] Rizk-Allah , R.M ., Elsayed ,M. Zaki., Ahmed ,Ahmed El-Sawy :Hybridizing ant colony
optimization with firefly algorithm for unconstrained optimization problems, Applied
Mathematics and Computation 224 (2013) 473–483.
[7] Karaboga , D., Gorkemli ,B :A Combinatorial Artificial Bee Colony Algorithm for Traveling
salesman problem ,IEEE Transactions,50-53,2011.
[8] Chen ,S., Chien ,C : Parallelized genetic ant colony systems for solving the traveling salesman
problem, Expert Systems with Applications 38 (2011) 3873–3883.
[9] Ginnu ,G ., Raimond ,K :Solving Travelling Salesman Problem Using Variants of ABC
Algorithm, The International Journal of Computer Science & Applications (TIJCSA), Volume
2, No. 01, March 2013 ISSN – 2278-1080.
[10] Florios ,K., Mavrotas ,G : Generation of the exact Pareto set in Multi-Objective Traveling
Salesman and Set Covering Problems, Applied Mathematics and Computation 237 (2014) 1–
19.
[11] Varunika, Arya., Amit, Goyal.,Vibhuti ,Jaiswal : An Optimal Solution To Multiple
Travelling Salesperson Problem Using Modified Genetic Algorithm ,vol.3,issue1, January
2014.
[12] Yang, X.S : “Firefly algorithms for multimodal optimization”, in: Stochastic Algorithms:
Foundations and Applications, SAGA 2009, Lecture Notes in Computer Sciences, Vol. 5792,
pp. 169-178 (2009).
[13] Godinho ,M.T., Gouveia ,L., Pesneau ,P :Natural and extended formulations for the Time-
Dependent Traveling Salesman Problem, Discrete Applied Mathematics 164 (2014) 138–153.
[14] Roemer ,T.,Ahmadi ,R., Sriram ,Dasu : “The Traveling Salesman Problem with flexible
coloring, Discrete Applied Mathematics 160 (2012) 1798–1814.
[15] Nitesh M Sureja, Bharat V Chawda, “An ACO Approach to Solve a Variant of TSP”,
International Journal of Advanced Research in Computer Engineering & Technology, Volume
1, Issue 5, July 2012.

Thank you for copying data from http://www.arastirmax.com