Main Article Content
Abstract
The Travelling Salesman Problem, TSP, is a well known and popular problem that has
become a standard for testing computational algorithms. The basic problem is that of a
salesman 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 total
distance.
The aim of this research is to solve the problem with Genetic algorithm and its
methods. The result of the research is software whose input is a cartesius coordinate and
output is a graph that present the minimum route.
Keywords: genetic algorithm, chromosom, generation, fitness, crossover, mutation.
become a standard for testing computational algorithms. The basic problem is that of a
salesman 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 total
distance.
The aim of this research is to solve the problem with Genetic algorithm and its
methods. The result of the research is software whose input is a cartesius coordinate and
output is a graph that present the minimum route.
Keywords: genetic algorithm, chromosom, generation, fitness, crossover, mutation.