Heuristic Approaches to Solve Traveling Salesman Problem  

Oleh:

Abid, Malik Muneeb ; Muhammad, Iqbal

Jenis: Article from Journal - ilmiah nasional - terakreditasi DIKTI
Dalam koleksi: Telkomnika Indonesian Journal of Electrical Engineering vol. 15 no. 02 (Aug. 2015), page 390-396.
Topik: TSP; heuristics; survey; NP-hard
Fulltext: 8301-18580-1-PB.pdf (168.88KB)

Isi artikel

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.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali