Skip to main content

A Fast Genetic Algorithm with Sharing Scheme Using Cluster Analysis Methods in Multimodal Function Optimization

  • Conference paper
Artificial Neural Nets and Genetic Algorithms

Abstract

Genetic algorithms with sharing are well known for tackling multimodal function optimization problems. In this paper, a sharing scheme using a clustering methodology is introduced and compared with the classical sharing scheme. It is shown from the simulation on test functions and on a practical problem that the proposed scheme proceeds faster than the classical scheme with a performance remaining as good as the classical one. In addition, the proposed scheme reveals unknown multimodal function structure when a priori knowledge about the function is poor. Finally, introduction of a mating restriction inside the proposed scheme is investigated and shown to increase the optimization quality without requiring additional computation efforts.

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. D.J. Cavicchio, ‘Adaptive search using simulated evolution’, Ph.D. Thesis, Univ. Michigan, 1970

    Google Scholar 

  2. K. A. De Jong, ‘Analysis of the behavior of a class of genetic adaptive systems’, Ph.D. Thesis, Univ. Michigan, Univ.Abst.Inter. 36(10), 5140B, 1975.

    Google Scholar 

  3. S.W. Mahfoud, ‘Crowding and preselection revisited’, Proc. 2nd Conf. Parallel Problem Solving from Nature, pp.27-36, 1992.

    Google Scholar 

  4. David E. Goldberg and Joh Richardson, ‘Genetic algorithms with sharing for multimodal function optimization’, Proc. 2nd Inter. Conf. Genetic Algorithms, pp.41-49., 1987

    Google Scholar 

  5. Kalyanmoy Deb and David E. Goldberg, ‘An Investigation of Niche and Species Formation in Genetic Function Optimization’, Proc. 3rd Inter. Conf. Genetic Algorithms, pp.42-50, 1989

    Google Scholar 

  6. D.E. Goldberg, K. Deb and J. Horn, ‘Massive multimodality, deception, and genetic algorithms’, Proc. 2nd Conf. Parallel Problem Solving from Nature, pp. 37-46, 1992.

    Google Scholar 

  7. Michael R. Anderberg, ‘Cluster Analysis for Applications’, Academic press, 1975.

    Google Scholar 

  8. Goldberg, ‘Genetic Algorithms in Search, Optimization, and Machine Learning’, New York: Addison — Wesley, 1989.

    MATH  Google Scholar 

  9. Xiaodong Yin and Noël Germay, ‘Investigations on Solving Load Flow Problems by Genetic Algorithms’, Electric Power System Research, Vol.22, pp.151–163, 1991.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag/Wien

About this paper

Cite this paper

Yin, X., Germay, N. (1993). A Fast Genetic Algorithm with Sharing Scheme Using Cluster Analysis Methods in Multimodal Function Optimization. In: Albrecht, R.F., Reeves, C.R., Steele, N.C. (eds) Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-7533-0_65

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-7533-0_65

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-82459-7

  • Online ISBN: 978-3-7091-7533-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics