IDEAS home Printed from https://ideas.repec.org/a/igg/jisscm/v7y2014i1p73-87.html
   My bibliography  Save this article

Review of Solution Approaches for the Symmetric Traveling Salesman Problem

Author

Listed:
  • Georgios K. D. Saharidis

    (Department of Mechanical Engineering, University of Thessaly, Volos, Greece)

Abstract

In this paper, the main known exact and heuristic solution approaches and algorithms for the symmetric Traveling Salesman Problem (TSP), published after 1992, are surveyed. The paper categorize the most important existing algorithm to 6 main groups: i) Genetic algorithms, ii) Ant colony methods, iii) Neural Methods, iv) Local search algorithms and Tabu search, v) Lagrangian methods and vi) Branch and bound and branch & cut algorithms.

Suggested Citation

  • Georgios K. D. Saharidis, 2014. "Review of Solution Approaches for the Symmetric Traveling Salesman Problem," International Journal of Information Systems and Supply Chain Management (IJISSCM), IGI Global, vol. 7(1), pages 73-87, January.
  • Handle: RePEc:igg:jisscm:v:7:y:2014:i:1:p:73-87
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijisscm.2014010105
    Download Restriction: no
    ---><---

    More about this item

    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:igg:jisscm:v:7:y:2014:i:1:p:73-87. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.