Skip to main content
SpringerLink
Log in
Book cover

Introduction to Evolutionary Algorithms pp 165–191Cite as

Multimodal Optimization

  • Chapter

Part of the book series: Decision Engineering ((DECENGIN,volume 0))

Abstract

Sometimes you run a EA for a problem several times. The algorithm might provide different solutions with similar qualities. You may feel uncomfortable with this. We will show you in this chapter that there really exist problems with several high-quality solutions and we want to find all of them in a single run of an EA. Techniques in this chapter could also help to adjust the tradeoff between selective pressure and population diversity, which is an eternal subject in designing and analyzing EAs.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   199.99
Price excludes VAT (USA)
  • Durable hardcover 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Li J, Balazs ME, Parks GT et al (2002) A species conserving genetic algorithm for multimodal function optimization. Evol Comput 10(3):207–234

    Article  Google Scholar 

  2. Beasley D, Bull D, Martin R (1993) A sequential niche technique for multimodal function optimization. Evol Comput 1(2):101–125

    Article  Google Scholar 

  3. Goldberg DE, Richardson J (1987) Genetic algorithms with sharing for multimodal function optimization. In: Proceedings of the 2nd international conference on genetic algorithms and their applications, pp 41–49

    Google Scholar 

  4. Ursem R (2001) When sharing fails. In: Proceedings of the IEEE congress on evolutionary computation, pp 873–879

    Google Scholar 

  5. Deb K, Goldberg DE (1989) An investigation of niche and species formation in genetic function optimization. In: Proceedings of international conference on genetic algorithms, pp 42–50

    Google Scholar 

  6. Petrowski A (1996) A clearing procedure as a niching method for genetic algorithms. In: Proceedings of the IEEE conference on evolutionary computation, pp 798–803

    Google Scholar 

  7. Lee C, Cho D, Jung H (1999) Niching genetic algorithm with restricted competition selection for multimodal function optimization. IEEE Trans Magnet 35(3):1722–1725

    Article  Google Scholar 

  8. Yin X, Germay N (1993) A fast genetic algorithm with sharing scheme using cluster analysis methods in multimodal function optimization. In: Proceedings of international conference on artificial neural nets and genetic algorithms, pp 450–457

    Google Scholar 

  9. Duda RO, Hart PE, Stork DG (2000) Pattern classification, 2nd edn. Wiley-Interscience, New York

    Google Scholar 

  10. Bishop CM (2007) Pattern recognition and machine learning. Springer, Berlin Heidelberg New York

    Google Scholar 

  11. Xu R, Wunsch D (2008) Clustering. Wiley-IEEE, New York

    Book  Google Scholar 

  12. Alpaydin E (2004) Introduction to machine learning. MIT Press, Cambridge, MA

    Google Scholar 

  13. Xu R, Wunsch D (2005) Survey of clustering algorithms. IEEE Trans Neural Netw 16(3):645–678

    Article  Google Scholar 

  14. Shan S, Xinjie Y (2006) Multi-peak function optimization using a hierarchical clustering based genetic algorithm. In: Proceedings of the sixth international conference on intelligent systems design and applications, pp 425–428

    Google Scholar 

  15. Yu X (2005) A novel clustering fitness sharing genetic algorithm. In: Proceedings of the international conference on natural computation, pp 1072–1079

    Google Scholar 

  16. Ando S, Sakuma J, Kobayashi S (2005) Adaptive isolation model using data clustering for multimodal function optimization. In: Proceedings of the ACM conference on genetic and evolutionary computation, pp 1417–1424

    Google Scholar 

  17. Miller BL, Hansen N, Shaw MJ (1995) Genetic algorithms with dynamic niche sharing for multimodal function optimization. Tech. Rep. 95010, University of Illinois at Urbana-Champaign

    Google Scholar 

  18. Miller B, Shaw M (1996) Genetic algorithms with dynamic niche sharing for multimodal function optimization. In: Proceedings of IEEE conference on evolutionary computation, pp 786–791

    Google Scholar 

  19. Cioppa AD, Stefano CD, Marcelli A (2004) On the role of population size and niche radius in fitness sharing. IEEE Trans Evol Comput 8(6):580–592

    Article  Google Scholar 

  20. Cioppa AD, Stefano CD, Marcelli A (2007) Where are the niches? dynamic fitness sharing. IEEE Trans Evol Comput 11(4):453–465

    Article  Google Scholar 

  21. Goldberg D, Wang L (1997) Adaptive niching via coevolutionary sharing. In: Miettinen K (ed) Genetic algorithms and evolution strategies in engineering and computer Science. Wiley, New York, pp 21–38

    Google Scholar 

  22. Jong KAD (1975) An analysis of the behavior of a class of genetic adaptive systems. Ph.D. thesis, University of Michigan

    Google Scholar 

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

    Google Scholar 

  24. Mahfoud SW (1995) A comparison of parallel and sequential niching methods. In: Proceedings of the international conference on genetic algorithms, pp 136–143

    Google Scholar 

  25. Gomez J (2004) Self adaptation of operator rates for multimodal optimization. In: Proceedings of the IEEE conference on evolutionary computation, pp 1720–1726

    Google Scholar 

  26. Mengshoel OJ (1999) Efficient Bayesian network inference: genetic algorithms, stochastic local search, and abstraction. Ph.D. thesis, University of Illinois at Urbana-Champaign

    Google Scholar 

  27. Mengshoel OJ, Goldberg DE (2008) The crowding approach to niching in genetic algorithms. Evol Comput 16(3):315–354

    Article  Google Scholar 

  28. Harik G (1995) Finding multimodal solutions using restricted tournament selection. In: Proceedings of the international conference on genetic algorithms, pp 24–31

    Google Scholar 

  29. Cedeño W (1995) The multi-niche crowding genetic algorithm: analysis and applications. Ph.D. thesis, Universiteit California at Davis

    Google Scholar 

  30. Li J, Balazs ME, Parks GT et al (2003) Erratum: a species conserving genetic algorithm for multimodal function optimization. Evol Comput 11(1):107–109

    Article  Google Scholar 

  31. Liu X, Lee B (2004) Optimal design of fiber raman amplifier based on hybrid genetic algorithm. IEEE Photon Technol Lett 16(2):428–430

    Article  Google Scholar 

  32. Shir OM (2008) Niching in derandomized evolution strategies and its applications in quantum control. Ph.D. thesis, Leiden University

    Google Scholar 

  33. Yu X (2005) Fitness sharing genetic algorithm with self-adaptive annealing peaks radii control method. In: Proceedings of the international conference on natural computation, pp 1064–1071

    Google Scholar 

  34. Martin W, Lienig J, Cohoon J (1997) Island migration models: evolutionary algorithms based on punctuated equilibria. In: Bäck T, Fogel DB, Michalewicz Z (eds) Handbook of evolutionary computation. Oxford University Press, Oxford, UK, C6.3:1–16

    Google Scholar 

  35. Spears WM (1994) Simple subpopulation schemes. In: Proceedings of the 3rd annual conference on evolutionary programming, pp 296–307

    Google Scholar 

  36. Ursem RK (1999) Multinational evolutionary algorithms. In: Proceedings of the IEEE congress on evolutionary computation, pp 1633–1640.

    Google Scholar 

  37. Sareni B, Krahenbuhl L (1998) Fitness sharing and niching methods revisited. IEEE Trans Evol Comput 2(3):97–106

    Article  Google Scholar 

  38. Singh G, Deb K (2006) Comparison of multi-modal optimization algorithms based on evolutionary algorithms. In: Proceedings of the ACM annual conference on genetic and evolutionary computation, pp 1305–1312

    Google Scholar 

  39. Shir OM, Bäck T (2009) Niching with derandomized evolution strategies in artificial and realworld landscapes. Nat Comput 8(1):171–196

    Article  MATH  Google Scholar 

  40. Wei L, Zhao M (2005) A niche hybrid genetic algorithm for global optimization of continuous multimodal functions. Appl Math Comput 160(3):649–661

    MATH  MathSciNet  Google Scholar 

Download references

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag London Limited

About this chapter

Cite this chapter

(2010). Multimodal Optimization. In: Introduction to Evolutionary Algorithms. Decision Engineering, vol 0. Springer, London. https://doi.org/10.1007/978-1-84996-129-5_5

Download citation

  • DOI: https://doi.org/10.1007/978-1-84996-129-5_5

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84996-128-8

  • Online ISBN: 978-1-84996-129-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation