Main Article Content
Abstract
Traveling Salesman Problem is one of the most famous optimization problem and genetic algorithm is the
most famous optimization problem solver. This paper demonstrates how the genetic algorithms can solve this
Traveling Salesman Problem effectively. The four variables of genetic algorithm that are number of
chromosomes, number of generations, crossover probability and mutation probability are set in such a way to
solve the problem.
Kata kunci: Traveling Salesman Problem, genetic algorithm, optimization
most famous optimization problem solver. This paper demonstrates how the genetic algorithms can solve this
Traveling Salesman Problem effectively. The four variables of genetic algorithm that are number of
chromosomes, number of generations, crossover probability and mutation probability are set in such a way to
solve the problem.
Kata kunci: Traveling Salesman Problem, genetic algorithm, optimization