TEMATIKA: Jurnal Penelitian Teknik Informatika dan Sistem Informasi
TEMATIKA Volume 3 Nomor 2 (September 2015)

Analisis Algoritma Genetika Tanpa Operasi Crossover Pada Kasus Travelling Salesman Problem Dengan Metode 2 Tahap Mutasi

Sean Coonery Sumarta (Unknown)

Article Info

Publish Date
01 Sep 2015

Abstract

The TSP problem can resolved using Genetic Algorithms. In other previous research, crossover is one process that can be eliminated from the genetic algorithm to get betternoptimization. This research tried to solve TSP by using genetic algorithms without using the crossover. To improve optimization by applying the method of mutation with 2 phases. Mutation operator used the inversion mutation, exchange mutation, and insertion mutation. The results using these methods is the average error percentage of optimum distance <10%.

Copyrights © 2015




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
TEMATIKA: Jurnal Penelitian Teknik Informatika dan Sistem Informasi
Website

Abbrev

tematika

Publisher

Universitas Atma Jaya Makassar

Subject

Computer Science & IT

Description

TEMATIKA (ISSN: 2303-3878, e-ISSN: 2338-8641) is an interdisciplinary journal of original research and writing in the wide areas of informatics and Information ...