Skip to main content

Diversity-Based Offspring Selection Criteria for Genetic Algorithms

  • Conference paper
  • First Online:
  • 1533 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9520))

Abstract

Genetic algorithms can be affected by an early loss of diversity in their populations called premature convergence. To address this problem, this paper presents two extensions for the offspring selection genetic algorithm. Both extensions are based on diversity maintenance mechanisms applied when selecting offspring for the next generation. The first approach focuses on producing solutions that feature a predefined quality improvement as well as an appropriate structural distance from their parents. The second approach monitors the average diversity of the population and selects more diverse offspring if the population does not meet a predefined diversity. We show that these algorithms allow to control diversity and are useful methods for influencing the development of the population independent of the algorithms other parameters.

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

Buying options

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 EPUB and 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

Learn about institutional subscriptions

Notes

  1. 1.

    http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/.

  2. 2.

    http://dev.heuristiclab.com.

References

  1. Hansheng, L., Lishan, K.: Balance between exploration and exploitation in genetic search. Wuhan Univ. J. Nat. Sci. 4, 28–32 (1999)

    Article  MATH  Google Scholar 

  2. Leung, Y., Gao, Y., Xu, Z.B.: Degree of population diversity - a perspective on premature convergence in genetic algorithms and its markov chain analysis. IEEE Trans. Neural Netw. 8, 1165–1176 (1997)

    Article  Google Scholar 

  3. Črepinšek, M., Liu, S.H., Mernik, M.: Exploration and exploitation in evolutionary algorithms: a survey. ACM Comput. Surv. 45, 1–33 (2013)

    MATH  Google Scholar 

  4. Scheibenpflug, A., Wagner, S.: An analysis of the intensification and diversification behavior of different operators for genetic algorithms. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds.) EUROCAST. LNCS, vol. 8111, pp. 364–371. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  5. Pandey, H.M., Choudhary, A., Mehrotra, D.: A comparative review of approaches to prevent premature convergence in GA. Appl. Soft Comput. 24, 1047–1077 (2014)

    Article  Google Scholar 

  6. Mahfoud, S.W.: Niching methods for genetic algorithms. Ph.D. thesis, University of Illinois at Urbana-Champaign (1995)

    Google Scholar 

  7. Goldberg, D.E., Richardson, J.: Genetic algorithms with sharing for multimodal function optimization. In: Proceedings of the Second International Conference on Genetic Algorithms on Genetic Algorithms and Their Application, pp. 41–49, L. Erlbaum Associates Inc. (1987)

    Google Scholar 

  8. Affenzeller, M., Wagner, S.: Offspring selection: a new self-adaptive selection scheme for genetic algorithms. In: Ribeiro, B., Albrecht, R.F., Dobnikar, A., Pearson, D.W., Steele, N.C. (eds.) Adaptive and Natural Computing Algorithms. Springer Computer Series, pp. 218–221. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  9. Affenzeller, M., Wagner, S.: SASEGASA: an evolutionary algorithm for retarding premature convergence by self-adaptive selection pressure steering. In: Mira, J., Alvarez, J.R. (eds.) IWANN 2003. LNCS, vol. 2686, pp. 438–445. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  10. Affenzeller, M., Wagner, S.: Reconsidering the selection concept of genetic algorithms from a population genetics inspired point of view. In: Trappl, R. (ed.) Cybernetics and Systems 2004, vol. 2, pp. 701–706. Austrian Society for Cybernetic Studies, Vienna (2004)

    Google Scholar 

  11. Affenzeller, M., Wagner, S., Winkler, S.: Goal-oriented preservation of essential genetic information by offspring selection. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2005), vol. 2, pp. 1595–1596. Association for Computing Machinery (ACM) (2005)

    Google Scholar 

  12. Wagner, S., Kronberger, G., Beham, A., Kommenda, M., Scheibenpflug, A., Pitzer, E., Vonolfen, S., Kofler, M., Winkler, S., Dorfer, V., Affenzeller, M.: Architecture and design of the heuristiclab optimization environment. In: Klempous, R., Nikodem, J., Jacak, W., Chaczko, Z. (eds.) Advanced Methods and Applications in Computational Intelligence. TIEI, vol. 6, pp. 193–258. Springer, Heidelberg (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Andreas Scheibenpflug .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Scheibenpflug, A., Wagner, S., Affenzeller, M. (2015). Diversity-Based Offspring Selection Criteria for Genetic Algorithms. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2015. EUROCAST 2015. Lecture Notes in Computer Science(), vol 9520. Springer, Cham. https://doi.org/10.1007/978-3-319-27340-2_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-27340-2_49

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-27339-6

  • Online ISBN: 978-3-319-27340-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics