Admi Syarif, AS and Wamiliana, Wamiliana and Wijaya, Yasir (2008) Peer Review: Evaluasi Kinerja Metode Metode Heuristik Untuk Penyelesaian Travelling Salesman Problem. Fakultas MIPA Universitas Lampung.

14. jsmipa08_nilai.pdf

Download (6MB) | Preview
Official URL:


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: Other
Subjects: T Technology > T Technology (General)
Divisions: Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA) > Prodi Ilmu Komputer
Depositing User: DR Admi Syarif
Date Deposited: 01 Apr 2021 01:47
Last Modified: 01 Apr 2021 01:47

Actions (login required)

View Item View Item