Analisis Algoritma Genetika Tanpa Operasi Crossover Pada Kasus Travelling Salesman

Sean Coonery Sumarta

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 better optimization. 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%.

Keywords: Travelling Salesmen Problem, Genetic Algorthim, Two Step Mutattion


Full Text:

PDF

Refbacks

  • There are currently no refbacks.


Indexed By

   



TEMATIKA Journal of Informatic and Information Systems © Atma Jaya University, all right reserved.
Use of this website signifies your agreement to the Terms of Use.
powered by Open Journal System