Skip to main content
Log in

Niching method using clustering crowding

  • Electro-Mechanical Engineering And Information Science
  • Published:
Journal of Central South University of Technology Aims and scope Submit manuscript

Abstract

This study analyzes drift phenomena of deterministic crowding and probabilistic crowding by using equivalence class model and expectation proportion equations. It is proved that the replacement errors of deterministic crowding cause the population converging to a single individual, thus resulting in premature stagnation or losing optional optima. And probabilistic crowding can maintain equilibrium multiple subpopulations as the population size is adequate large. An improved niching method using clustering crowding is proposed. By analyzing topology of fitness landscape using hill valley function and extending the search space for similarity analysis, clustering crowding determines the locality of search space more accurately, thus greatly decreasing replacement errors of crowding. The integration of deterministic and probabilistic replacement increases the capacity of both parallel local hill climbing and maintaining multiple subpopulations. The experimental results optimizing various multimodal functions show that, the performances of clustering crowding, such as the number of effective peaks maintained, average peak ratio and global optimum ratio are uniformly superior to those of the evolutionary algorithms using fitness sharing, simple deterministic crowding and probabilistic crowding.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Goldberg D E, Richardson J. Genetic algorithms with sharing for multimodal function optimization[A]. Proc 2nd Int Conf Genetic Algorithms[C]. 1987. 41–49.

  2. Jelasity M, GAS, a concept on modeling species in genetic algorithms[J]. Artificial Intelligence, 1998, 99 (1): 1–19.

    Article  MathSciNet  Google Scholar 

  3. DeJong K A. An analysis of the behavior of a class of genetic adaptive systems[D]. Univ of Michigan, Ann Arbor, 1975.

    Google Scholar 

  4. Mahfoud S W. Niching Methods for genetic algorithms [D]. Univ of Illinois, Urbana-Champaign, 1995.

    Google Scholar 

  5. Mengshoel O J, Goldberg D E. Probabilistic crowding: deterministic crowding with probabilistic replacement, Illinois Genetic Algorithms Laboratory [R]. Univ of Illinois, Urbana-Champaign, Tech. Rep. 99004, Jan. 1999.

  6. Ursem R. Multinational evolutionary algorithms[A]. Proc 1999 IEEE Int Conf Evolutionary Computation [C]. 1999. 1633–1640.

  7. Gan J, Warwick K. Dynamic niche clustering: a fuzzy variable radius niching technique for multimodal optimization in GAs[A]. Proc 2001 IEEE Int Conf Evolutionary Computation[C]. 2001. 215–222.

  8. Sareni B, Krähenbühl L. Fitness sharing and niching methods revisited[J]. IEEE Trans Evolutionary Computation, 1998, 2(1): 97–106.

    Article  Google Scholar 

  9. Pétrowski A. A clearing procedure as a niching method for genetic algorithms[A]. Proc 1996 IEEE Int Conf Evolutionary Computation[C]. 1996. 798–803.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Guo Guan-qi PhD.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Guo, Gq., Gui, Wh., Wu, M. et al. Niching method using clustering crowding. J Cent. South Univ. Technol. 12 (Suppl 1), 203–209 (2005). https://doi.org/10.1007/s11771-005-0400-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11771-005-0400-7

Key words

CLC number

Navigation