Review of Solution Approaches for the Symmetric Traveling Salesman Problem

Georgios K. D. Saharidis
Additional contact information
Georgios K. D. Saharidis: Department of Mechanical Engineering, University of Thessaly, Volos, Greece

International Journal of Information Systems and Supply Chain Management (IJISSCM), 2014, vol. 7, issue 1, 73-87

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.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 8/ijisscm.2014010105 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jisscm:v:7:y:2014:i:1:p:73-87

Access Statistics for this article

International Journal of Information Systems and Supply Chain Management (IJISSCM) is currently edited by John Wang

More articles in International Journal of Information Systems and Supply Chain Management (IJISSCM) from IGI Global
Bibliographic data for series maintained by Journal Editor ().