A COMPARATIVE STUDY OF CROSSOVER OPERATORS FOR GENETIC ALGORITHMS TO SOLVE TRAVELLING SALESMAN PROBLEM

Genetic algorithms (GAs) represent a method that mimics the process of natural evolution in effort to find good solutions. In that process, crossover operator plays an important role. To comprehend the genetic algorithms as a whole, it is necessary to understand the role of a crossover operator. Today, there are a number of different crossover operators that can be used , one of the problems in using genetic algorithms is the choice of crossover operator Many crossover operators have been proposed in literature on evolutionary algorithms, however, it is still unclear which crossover operator works best for a given optimization problem. This paper aims at studying the behavior of different types of crossover operators in the performance of genetic algorithm. These types of crossover are implemented on Traveling Salesman Problem (TSP); Whitley used the order crossover (OX) depending on specific parameters to solve the traveling salesman problem, the aim of this paper is to make a comparative study between order crossover (OX) and other types of crossover using the same parameters which was Whitley used