A Crowding Niche Cellular Genetic Algorithm

Abstract:

This paper presents a crowding niche cellular genetic algorithm (referred to NCGA) aiming at solving the problems of local convergence and non-uniform population distribution in traditional genetic algorithm. The selecting operation in traditional genetic algorithm is improved by bringing in the concept of neighbors of cellular genetic algorithm, and the population distribution is greatly enhanced by introducing crowding niche mechanism, which betters the ability of global searching and helps to avoid the population local convergence. Meanwhile, the paper describes the crowding niche cellular genetic algorithm in details and compares it with simple genetic algorithm （SGA） and simple niche genetic algorithm （NGA）; the comparison results reveal that, NCGA outperforms the other two algorithms in terms of convergence rate and population diversity.

• Periodical: Advanced Materials Research (Volumes 482-484)
• Pages: 1933-1936
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.482-484.1933
• Online since: February 2012
• Authors: Yi Zhang, Zheng Liu, Hu Zhang, Hui Fang Li
• Keywords: Cellular, Convergence, Genetic Algorithm (GA), Niche, Population Distribution

References

[1] Wang X P, Cao L M., Genetic Algorithms: Theory, application software, Xi'an Jiao tong University Press, (2002)

[2] Yuming Lu, Ming Li, Ling Li. Cellular Genetic Algorithms with Evolutional Rule, IEEE int. conf. on intelligent systems and application, 2009.05

[3] Yuming Lu, Ming Li, Ling Li. Cellular genetic algorithms with disaster: the size of disaster effects, 2009 International Conference on Information Engineering and Computer Science, 2009.12

DOI: 10.1109/iciecs.2009.5364398

[4] Yuming Lu, Ming Li, Ling Li, ACTA ELECTRONICA SINICA, 2010, No.7, 1603-1607

[5] Yu Zhang. Research For Cellular Genetic Algorithm. Nanchang Hangkong University Master thesis, 2009.06

[6] He, Y.P., He, H., Zhang, X.L., Journal of Harbin Institute of Technology, 41, 67–70, (2009)