Skip to main content

Adaptive Elitist-Population Based Genetic Algorithm for Multimodal Function Optimization

  • Conference paper
  • First Online:
Genetic and Evolutionary Computation — GECCO 2003 (GECCO 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2723))

Included in the following conference series:

Abstract

This paper introduces a new technique called adaptive elitist-population search method for allowing unimodal function optimization methods to be extended to efficiently locate all optima of multimodal problems. The technique is based on the concept of adaptively adjusting the population size according to the individuals’ dissimilarity and the novel elitist genetic operators. Incorporation of the technique in any known evolutionary algorithm leads to a multimodal version of the algorithm. As a case study, genetic algorithms(GAs) have been endowed with the multimodal technique, yielding an adaptive elitist-population based genetic algorithm(AEGA). The AEGA has been shown to be very efficient and effective in finding multiple solutions of the benchmark multimodal optimization problems.

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 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. D.E. Goldberg and J. Richardson, Genetic algorithms with sharing for multimodal function optimization, Proc. 2 nd ICGA, pp.41–49, 1987

    Google Scholar 

  2. Eshelman. L.J. The CHC adaptive search algorithm: how to have safe search when engaging in nontraditional genetic recombination. In Rawlins, G.J.E., editor, Foundation of Genetic Algorithms pp.265–283, Morgan Kaufmann, San Mateo, California, 1991

    Google Scholar 

  3. Holland J.H. and Adaptation in Natural and ArtificialSystem. University of Michigan Press, Ann Arbor, Michigan, 1975.

    Google Scholar 

  4. K.A. De Jong, An analysis of the behavior of a class of genetic adaptive systems, Doctoral dissertation, Univ. of Michigan, 1975

    Google Scholar 

  5. L.N. Castro and F.J. Zuben, Learning and Optimization Using the Clonal Selection Principle, IEEE Transactions on EC, vol. 6 pp.239–251, 2002

    Google Scholar 

  6. Sarma. J. and De Jong, Generation gap methods. Handbook of Evolutionary Computation, pp.C2.7:1–C2.7:5, 1997

    Google Scholar 

  7. S.W. Mahfoud. Niching Methods for Genetic algorithms, Doctoral Dissertation, IlliGAL Report 95001, University of Illinois at Urbana Champaign, Illinois Genetic Algorithm Laboratory, 1995

    Google Scholar 

  8. Whitley. D., The GENITOR algorithm and selection pressure: why rank-based allocation of reproductive trials is best. Proc. 3rd ICGA, pp.116–121, 1989

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Leung, KS., Liang, Y. (2003). Adaptive Elitist-Population Based Genetic Algorithm for Multimodal Function Optimization. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2723. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45105-6_124

Download citation

  • DOI: https://doi.org/10.1007/3-540-45105-6_124

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40602-0

  • Online ISBN: 978-3-540-45105-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics