Open AccessHeuristic Approaches to Solve Traveling Salesman Problem
Author(s) -
Malik Muneeb Abid,
Iqbal Muhammad
Publication year - 2015
Publication title -
telkomnika: indonesian journal of electrical engineering/telkomnika
Language(s) - English
Resource type - Journals
eISSN - 2460-7673
pISSN - 2302-4046
DOI - 10.11591/tijee.v15i2.1554
Subject(s) - travelling salesman problem , heuristics , mathematical optimization , heuristic , lin–kernighan heuristic , computer science , traveling purchaser problem , 2 opt , bottleneck traveling salesman problem , mathematics
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.