Heuristic Approaches to Solve Traveling Salesman Problem

Malik Muneeb Abid (Southwest Jiaotong University Chengdu, China)
Iqbal Muhammad (School of Information Sciences and Technology, Southwest JiaoTong University, Chengdu, China)

Indonesian Journal of Electrical Engineering and Computer Science
Vol 15, No 2: August 2015

This paper provides the survey of the heuristics solution approaches for the traveling salesman problem (TSP). TSP is easy to understand, however, it is very difficult to solve. Due to complexity involved with exact solution approaches it is hard to solve TSP within feasible time. That’s why different heuristics are generally applied to solve TSP. Heuristics to solve TSP are presented here with detailed algorithms. At the end, comparison among selected approaches shows the efficiency of approaches in terms of solution quality and time consumed to solve TSP.