Genetic Algorithm As The Optimization Solution In A Travelling Salesman Problem

Abstract

Travelling Salesman Problem (TSP) talking about optimization, which has simple concept and easy to understand. The optimization in TSP which is to find shortest path to passed some cities with routed path in order to make sure only one city passed and ended in the starting city. To solve this problem is implementing evolution theory of Genetic Algorithm relating parent selection as the symbol of the TSP problem used as the candidate in the crossover process that will result offspring with the best quality that will replace the parent as the new population. This method will solve the TSP which consequently the optimum path to lower the cost of visiting cities.