Genetic algorithms (GAs) generate solutions to optimization problems using techniques inspired by natural evolution, like crossover, selection and mutation. In that process, crossover operator plays an important role as an analogue to reproduction in biological sense. During the last decades, a number of different crossover operators have been successfully designed. However, systematic comparison of those operators is difficult to find. This paper presents a comparison of 10 crossover operators that are used in genetic algorithms with binary representation. To achieve this, experiments are conducted on a set of 15 optimization problems. A thorough statistical analysis is performed on the results of those experiments. The results show significant statistical differences between operators and an overall good performance of uniform, single-point and reduced surrogate crossover. Additionally, our experiments have shown that orthogonal crossover operators perform much poorer on the given problem set and constraints. © 2012 Springer-Verlag.
CITATION STYLE
Picek, S., Golub, M., & Jakobovic, D. (2011). Evaluation of crossover operator performance in genetic algorithms with binary representation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6840 LNBI, pp. 223–230). https://doi.org/10.1007/978-3-642-24553-4_31
Mendeley helps you to discover research relevant for your work.