Skip to main content

Evaluation of Crossover Operator Performance in Genetic Algorithms with Binary Representation

  • Conference paper
Bio-Inspired Computing and Applications (ICIC 2011)

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 6840))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chan, K.Y., Kwong, C.K., Jiang, H., Aydin, M.E., Fogarty, T.C.: A new orthogonal array based crossover, with analysis of gene interactions, for evolutionary algorithms and its application to car door design. Expert Systems with Applications (37), 3853–3862 (2010)

    Google Scholar 

  2. Derrac, J., Garcia, S., Molina, D., Herrera, F.: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm and Evolutionary Computation (1), 3–18 (2011)

    Google Scholar 

  3. Dumitrescu, D., Lazzerini, B., Jain, L.C., Dumitrescu, A.: Evolutionary Computation. CRC Press, Florida (2000)

    MATH  Google Scholar 

  4. Eshelman, L.J.: The chc adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination. In: Foundations of Genetic Algorithms, pp. 265–283. Morgan Kaufmann, San Francisco (1991)

    Google Scholar 

  5. Garcia, S., Molina, D., Lozano, M., Herrera, F.: A study on the use of non-parametric tests for analyzing the evolutionary algorithms behaviour: a case study on the cec 2005 special session on real parameter optimization. Journal of Heuristics (15), 617–644 (2009)

    Google Scholar 

  6. Holland, J.H.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. The MIT Press, Cambridge (1992)

    Google Scholar 

  7. Ishibuchi, H., Tsukamoto, N., Nojima, Y.: Maintaining the diversity of solutions by non-geometric binary crossover: A worst one-max solver competition case study. In: Proceedings of the Genetic and Evolutionary Computation Conference GECCO 2008, pp. 1111–1112 (2008)

    Google Scholar 

  8. Jakobovic, D., et al.: Evolutionary computation framework. (March 2011), http://gp.zemris.fer.hr/ecf/ , http://gp.zemris.fer.hr/ecf/

  9. Leung, Y.W., Wang, Y.: An orthogonal genetic algorithm with quantization for global numerical optimization. IEEE Transactions on Evolutionary Computation 5(1), 41–53 (2001)

    Article  Google Scholar 

  10. Michalewitz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer, New York (1996)

    Book  Google Scholar 

  11. Mitchell, M.: An Introduction to Genetic Algorithms. The MIT Press, Cambridge (1999)

    MATH  Google Scholar 

  12. Pohlheim, H.: Geatbx examples examples of objective functions (2006), http://www.geatbx.com/download/GEATbx_ObjFunExpl_v38.pdf

  13. Sheskin, D.: Handbook of Parametric and Nonparametric Statistical Procedures, 4th edn. Chapman and Hall/CRC (2007)

    Google Scholar 

  14. Suganthan, P., Hansen, N., Liang, J., Deb, K., Chen, Y., Auger, A., Tiwari, S.: Problem definitions and evaluation criteria for the cec 2005 special session on real parameter optimization. Tech. Report, Nanyang Technological University (2005)

    Google Scholar 

  15. Tsai, J.T., Liu, T.K., Chou, J.H.: Hybrid taguchi-genetic algorithm for global numerical optimization. IEEE Transactions on Evolutionary Computation 8(4), 365–377 (2004)

    Article  Google Scholar 

  16. Weise, T.: Global Optimization Algorithms Theory and Application (2009), http://www.it-weise.de/

  17. Zhang, Q., Leung, Y.W.: An orthogonal genetic algorithm for multimedia multicast routing. IEEE Transactions on Evolutionary Computation 3(1), 53–62 (1999)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Picek, S., Golub, M., Jakobovic, D. (2012). Evaluation of Crossover Operator Performance in Genetic Algorithms with Binary Representation. In: Huang, DS., Gan, Y., Premaratne, P., Han, K. (eds) Bio-Inspired Computing and Applications. ICIC 2011. Lecture Notes in Computer Science(), vol 6840. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24553-4_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24553-4_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24552-7

  • Online ISBN: 978-3-642-24553-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics