Skip to main content
Springer Nature Link
Log in

Parallelized Crowding Scheme Using a New Interconnection Model

  • Conference paper
  • First Online:
Advances in Soft Computing — AFSS 2002 (AFSS 2002)

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

Included in the following conference series:

  • 1571 Accesses

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.

This work is supported by the MHRD project on Biomedical Image Processing Using Genetic Algorithm

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Goldberg, D.E. Genetic Algorithm in Search, Optimization and machine learning, Addison-Wesley, (1989).

    Google Scholar 

  2. T. Back, D. B. Fogel and T. Michalewicz, (Ed.): Evolutionary Computation 1; Basic Algorithms and operators, Institute of Physics publishing, Bristol and Philadelphia (2000)

    Google Scholar 

  3. Chellapilla Kumar: Combining Mutation Operators in Evolutionary Programming, IEEE Transaction on Evolutionary Computation, Vol.2, No.3, (1998), pp.91–96.

    Article  Google Scholar 

  4. Mahfoud, Samir. W.: Simple Analytical Models of Genetic Algorithms for Multi modal Function Optimization,Technical Report.Illinois Genetic Algorithm Laboratory, IlliGAL Report No.93001, Feb.(1993).

    Google Scholar 

  5. Cantu-Paz, E.: A summary of Research on Parallel Genetic Algorithms, IlliGAL Report No.95007, July (1995).

    Google Scholar 

  6. Cant-Paz, E.: Designing Efficient and Accurate Parallel Genetic Algorithms, parallel Genetic Algorithms, Ph.D. dissertation, Illinois Genetic Algorithm Laboratory, UIUC, USA, (1999).

    Google Scholar 

  7. Cant-Paz, E.: Migration policies and takeover times in parallel Genetic Algorithms, Proceedings of the International Conference on Genetic and Evolutionary Computation, San Francisco, CA, (1999), pp.775–779.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, Regional Engineering College, 769008, Rourkela, Orissa, India

    P. K. Nanda & P. Kanungo

  2. Electronics and Communication Science Unit, Indian Statistical Institute, 203 B. T. Road, 700 035, Calcutta, India

    D. P. Muni

Authors
  1. P. K. Nanda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. P. Muni
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. Kanungo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Electronics and Communication Sciences Unit, Indian Statistical Institute, 203 B.T. Road, 700108, Calcutta, India

    Nikhil R. Pal

  2. Brain Science Institute, RIKEN, 2-1 Hirosawa, Wako, Japan

    Michio Sugeno

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nanda, P.K., Muni, D.P., Kanungo, P. (2002). Parallelized Crowding Scheme Using a New Interconnection Model. In: Pal, N.R., Sugeno, M. (eds) Advances in Soft Computing — AFSS 2002. AFSS 2002. Lecture Notes in Computer Science(), vol 2275. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45631-7_59

Download citation

  • DOI: https://doi.org/10.1007/3-540-45631-7_59

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45631-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics