Parallelized crowding scheme using a new interconnection model

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this article, a new interconnection model is proposed for Parallel Genetic Algorithm based crowding scheme. The crowding scheme is employed to maintain stable subpopulations at niches of a multi modal nonlinear function. The computational burden is greatly reduced by parallelizing the scheme based on the notion of coarse grained parallelization. The proposed interconnection model with a new crossover operator known as Generalized Crossover (GC) was found to maintain stable subpopulation for different classes and its performance was superior to that of the with two point crossover operators. Convergence properties of the algorithm is established and simulation results are presented to demonstrate the efficacy of the scheme.

Cite

CITATION STYLE

APA

Nanda, P. K., Muni, D. P., & Kanungo, P. (2002). Parallelized crowding scheme using a new interconnection model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2275, pp. 436–443). Springer Verlag. https://doi.org/10.1007/3-540-45631-7_59

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free