Traveling Salesman Problem Using Genetic Algorithm: A Survey

Authors

  • Pooja Vaishnav  Department of Computer Science and Engineering, College of Technology and Engineering, Udaipur, Rajasthan, India
  • Dr. Naveen Choudhary  Department of Computer Science and Engineering, College of Technology and Engineering, Udaipur, Rajasthan, India
  • Kalpana Jain  Department of Computer Science and Engineering, College of Technology and Engineering, Udaipur, Rajasthan, India

Keywords:

Traveling Salesman Problem, Genetic Algorithm, Cross Over, Mutation

Abstract

Traveling Salesman Problem is a well-known NP-Complete problem in computer science. It has many application areas in science and engineering. It is an optimization problem. TSP can be solved using heuristic techniques such as genetic algorithm. This paper gives a brief survey of various existing techniques for solving TSP using Genetic Algorithm. The paper compares the advantages and disadvantages of various algorithms for solving TSP using GA. The paper compares the performance of various algorithms to solve TSP and also suggest some fu-ture directions for research to motivate new researchers in this field.

References

  1. Oliviu Matei et al,” An Efficient Genetic Algorithm for Solving the Generalized Traveling Salesman Problem”, 978-1-4244-8230-6/10/$26.00 ©2010 IEEE
  2. Gohar Vahdati at.al, “A hybrid Search Algorithm with Hopfield Neural Network and Genetic Algorithm for Solving Traveling Salesman Problem”, 978-1-4244-5586-7/10/$26.00 C 2010 IEEE
  3. Yang Yi et.al ,” The Improved Hybrid Genetic Algorithm for Solving TSP Based on Handel-C”, 20IO 3rd International Conference on Advanced Computer Theory and Engineering (ICACTE), 978-1-4244-6542-2/$26.00 © 2010 IEEE
  4. Musheer Ahmad et.al,” Efficient cryptographic substitution boxdesign using travelling salesman problemand chaos”, Perspectives in Science (2016) 8, 465—468
  5. Yuxin Liu, Chao Gao, Zili Zhang, Yuxiao Lu, Shi Chen, Mingxin Liang, and Li Tao,” Solving NP-Hard Problems with Physarum-Based Ant Colony System”, IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, VOL. 14, NO. 1, JANUARY/FEBRUARY 2017
  6. K. Bharathi et.al,” A Framework for the Design and Analysis of an Evolutionary Algorithm for Multi Travelling Salesman Problem”, Indian Journal of Science and Technology, Vol 9(48), DOI: 10.17485/ijst/2016/v9i48/104352, December 2016
  7. Rishita Kalyani,” Application of Multi-Core Parallel Programming to a Combination of Ant Colony Optimization and Genetic Algorithm”, Indian Journal of Science and Technology, Vol 8(S2), 138-142, January 2015
  8. Ghorbanali Mohammadi,” Using genetic algorithms to solve industrial time-cost trade-off problems”, Indian Journal of Science and Technology Vol. 4 No. 10 (Oct 2011) ISSN: 0974- 6846
  9. Bao Lin1 Xiaoyan Sun and Sana Salous,” Solving Travelling Salesman Problem with an Improved Hybrid Genetic Algorithm”, Journal of Computer and Communications, 2016, 4, 98- 06 http://www.scirp.org/journal/jcc ISSN Online: 2327-5227 ISSN Print: 2327-5219

IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology

Downloads

Published

2017-06-30

Issue

Volume 2, Issue 3, May-June-2017

Section

Research Articles

License

Copyright (c) IJSRCSEIT

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
Pooja Vaishnav, Dr. Naveen Choudhary, Kalpana Jain, " Traveling Salesman Problem Using Genetic Algorithm: A Survey, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 2, Issue 3, pp.105-108, May-June-2017.