Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5227))

Included in the following conference series:

  • 1520 Accesses

Abstract

This paper presents a novel explicit exploration information exchange mechanism for niche technique. In this framework, the whole population is divided into many sub-populations. The different sub-population communicates with each other. One sub-population exploration area does not be explored by others. Based on this framework, a multi-sub-swarm particle swarm optimization (MSSPSO) algorithm is implemented to test the thought. Five benchmark multimodal functions are used as test functions. The experimental results show that the proposed method has a stronger adaptive ability and a better performance for multimodal functions with respect to other niche techniques.

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 189.00
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. Mahfoud, S.W.: A Comparison of Parallel and Sequential Niching Methods. In: Proceedings of the Sixth International Conference on Genetic Algorithms, pp. 136–143 (1995)

    Google Scholar 

  2. Beasley, D., Bull, D.R., Martin, R.R.: A Sequential Niching Technique for Multimodal Function Optimization. Evolutionary Computation 1(2), 101–125 (1993)

    Article  Google Scholar 

  3. Goldberg, D.E., Richardson, J.: Genetic Algorithms with Sharing for Multimodal Function Optimization. In: Grefensette, J.J. (ed.) Proc. 2nd Int. Conf. Genetic Algorithms, pp. 41–49. Lawrence Erlbaum, Hillsdale (1987)

    Google Scholar 

  4. Mahfoud, S.W.: Crowding Preselection Revisited. Parallel Problem Solving from Nature, vol. 2, pp. 27–36. Elsevier, Amsterdam (1992)

    Google Scholar 

  5. Harik, G.R.: Finding Multimodal Solutions Using Restricted Tournament Selection. In: Proceedings of the Sixth International Conference on Genetic Algorithms (1995)

    Google Scholar 

  6. Brits, R., Engelbrecht, A.P., van den Bergh, F.: A Niching Particle Swarm Optimizer. In: Conference on Simulated Evolution and Learning, Singapore (2002)

    Google Scholar 

  7. Bird, S., Li, X.D.: Adaptively Choosing Niching Parameters in a PSO. In: Proceedings of the 8th annual conference on Genetic and evolutionary computation, Washington, USA, vol. 1, pp. 3–9 (2006)

    Google Scholar 

  8. Yeniay, Ö.: Penalty Function Methods for Constrained Optimization with Genetic Algorithms. Mathematical and Computational Applications 10(1), 45–56 (2005)

    Google Scholar 

  9. Ursem, R.K.: Multinational Evolutionary Algorithms. In: Proceedings of Congress of Evolutionary Computation, vol. 3, pp. 1633–1640 (1999)

    Google Scholar 

  10. Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proc. Of IEEE International Conference on Neural Networks (ICNN), Perth, Australia, vol. 4, pp. 1942–1948 (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

De-Shuang Huang Donald C. Wunsch II Daniel S. Levine Kang-Hyun Jo

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, J., Chau, KW. (2008). The Explicit Exploration Information Exchange Mechanism for Niche Technique. In: Huang, DS., Wunsch, D.C., Levine, D.S., Jo, KH. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence. ICIC 2008. Lecture Notes in Computer Science(), vol 5227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85984-0_70

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85984-0_70

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85983-3

  • Online ISBN: 978-3-540-85984-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics