Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal Seminar Nasional Aplikasi Teknologi Informasi (SNATI)
Irving Vitra P.
Unknown Affiliation
Computer Science & IT

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Perbandingan Metode-Metode dalam Algoritma Genetika untuk Travelling Salesman Problem Irving Vitra P.
Seminar Nasional Aplikasi Teknologi Informasi (SNATI) 2004
Publisher : Jurusan Teknik Informatika, Fakultas Teknologi Industri, Universitas Islam Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

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.
Co-Authors