Syarif, Admi and Wamiliana, Wamiliana and Wijaya, Yasir Evaluasi Kinerja Metode-metode Heuristik pada persolan Traveling Salesman Problem. Jurnal Sains MIPA, 14 (1). pp. 7-11. ISSN 1978-1873

This is the latest version of this item.

JN_7_JSMIPA_2008_Ketua - Vol 14_No 1.pdf

Download (1MB) | Preview


Traveling Salesman Problem (TSP) is known as one of optimization problems that has taken great attention of researchers in this last two decades. SinceTSP is included as an NP-Complete problems,most researchers researched on the development of heuristic method to get optimal/near optimal solutions of the problem. In this research, we developed and compared the effectiveness and the efficiency of several heuristic methods given in the literature. We tested those heuristics methods by using Benchmark test problems. It is shown that heuristic methods can give the optimal/near optimal solution of the problemwithin reasonable time. It is also shown, for relatively large size problems, that Lin-Kernighan is the most effective algorithm followed by Hybrid Genetic Algorithm (HGA)

Item Type: Article
Subjects: T Technology > T Technology (General)
Divisions: Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA) > Prodi Ilmu Komputer
Depositing User: DR Admi Syarif
Date Deposited: 03 Sep 2020 07:23
Last Modified: 03 Sep 2020 07:23

Available Versions of this Item

Actions (login required)

View Item View Item