Perbandingan Metode-Metode dalam Algoritma Genetika untuk Travelling Salesman Problem
| Main Author: | P., Irving Vitra |
|---|---|
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
Jurusan Teknik Informatika, Fakultas Teknologi Industri, Universitas Islam Indonesia
, 2009
|
| Online Access: |
http://journal.uii.ac.id/index.php/Snati/article/view/1819 http://journal.uii.ac.id/index.php/Snati/article/view/1819/1598 |
Daftar Isi:
- The Travelling Salesman Problem, TSP, is a well known and popular problem that hasbecome a standard for testing computational algorithms. The basic problem is that of asalesman working out the minimum distance tour of a number of cities, given their locations.Every city must be visited, but only once and the optimal solution has the lowest totaldistance.The aim of this research is to solve the problem with Genetic algorithm and itsmethods. The result of the research is software whose input is a cartesius coordinate andoutput is a graph that present the minimum route.Keywords: genetic algorithm, chromosom, generation, fitness, crossover, mutation.