Crossover versus Mutation: A Comparative Analysis of the Evolutionary Strategy of Genetic Algorithms Applied to Combinatorial Optimization Problems

Abstract EN

Since their first formulation, genetic algorithms (GAs) have been one of the most widely used techniques to solve combinatorial optimization problems.

The basic structure of the GAs is known by the scientific community, and thanks to their easy application and good performance, GAs are the focus of a lot of research works annually.

Although throughout history there have been many studies analyzing various concepts of GAs, in the literature there are few studies that analyze objectively the influence of using blind crossover operators for combinatorial optimization problems.

For this reason, in this paper a deep study on the influence of using them is conducted.

The study is based on a comparison of nine techniques applied to four well-known combinatorial optimization problems.

Six of the techniques are GAs with different configurations, and the remaining three are evolutionary algorithms that focus exclusively on the mutation process.

Finally, to perform a reliable comparison of these results, a statistical study of them is made, performing the normal distribution z-test.