IDEAS home Printed from https://ideas.repec.org/a/jbh/ijsrcs/v2y2017i3idhcseit1722335.html

Traveling Salesman Problem Using Genetic Algorithm: A Survey

Author

Listed:
  • Pooja Vaishnav
  • Naveen Choudhary
  • Kalpana Jain

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.

Suggested Citation

  • Pooja Vaishnav & Naveen Choudhary & Kalpana Jain, 2017. "Traveling Salesman Problem Using Genetic Algorithm: A Survey," International Journal of Scientific Research in Computer Science, Engineering and Information Technology, International Journal of Scientific Research in Computer Science, Engineering and Information Technology, vol. 2(3), pages 105-108, June.
    • Handle: RePEc:jbh:ijsrcs:v2:y2017:i3:id:hcseit1722335
    Note: Article URL: https://ijsrcseit.com/CSEIT1722335
    as

    Download full text from publisher

    File URL: https://ijsrcseit.com/CSEIT1722335
    File Function: Article URL
    Download Restriction: no
    File URL: https://ijsrcseit.com/paper/CSEIT1722335.pdf
    File Function: Full text
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:jbh:ijsrcs:v2:y2017:i3:id:hcseit1722335. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Pankaj Sharma (USA) (email available below). General contact details of provider: https://ijsrcseit.com/home .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.