Genetic operators crossover and mutation in solving the TSP problem

Abstract

This paper introduces a flexible method for finding a solution to the traveling salesman problem using a genetic algorithm. The traveling salesman problem comes up in different situations in out world. It is a special kind of optimization problem. There had been many attempts to address this problem using classical methods, such as integer programming and graph theory algorithms with diffrenet success The solution, which this paper offers, includes a genetic algorithm implementation in order to give a maximal approximation of the problem, modifying a generated solution with genetic operators.