A Dynamic Migration Model for Self-adaptive Genetic Algorithms | SpringerLink
Skip to main content

A Dynamic Migration Model for Self-adaptive Genetic Algorithms

  • Conference paper
Intelligent Data Engineering and Automated Learning - IDEAL 2005 (IDEAL 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3578))

Abstract

In this paper, we propose a self Adaptive Migration Model for Genetic Algorithms, where parameters of population size, the number of points of crossover and mutation rate for each population are fixed adaptively. Further, the migration of individuals between populations is decided dynamically. This paper gives a mathematical schema analysis of the method stating and showing that the algorithm exploits previously discovered knowledge for a more focused and concentrated search of heuristically high yielding regions while simultaneously performing a highly explorative search on the other regions of the search space. The effective performance of the algorithm is then shown using standard testbed functions, when compared with Island model GA(IGA) and Simple GA(SGA).

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 11439
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 14299
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

Similar content being viewed by others

References

  1. Back, T.: Self Adaptation in Genetic Algorithms. In: Varela, F.J., P.B. (ed.) Proceedings of First European Conference on Artificial Life, pp. 263–271 (1992)

    Google Scholar 

  2. Hinterding, R., Michalewicz, Z., Peachey, T.C.: Self Adaptive Genetic Algorithm for Neumeric Functions. In: Proceedings of the 4th Conference on Parallel Problem Solving from Nature, pp. 420–429 (1996)

    Google Scholar 

  3. Kee, E., Aiery, S., Cye, W.: An Adaptive Genetic Algorithm. In: Proceedings of The Genetic and Evolutionary Computation Conference, pp. 391–397 (2001)

    Google Scholar 

  4. De Jong, K.A.: An Analysis of the Behaviour of A Class of Genetic Adaptive Systems PhD Thesis, Department of Computer and Communication Sciences, University of Michigan, Ann Arbor

    Google Scholar 

  5. Spear, W.M., De Jong, K.: An Analysis of Multipoint Crossover, Foundations of Genetic Algorithms

    Google Scholar 

  6. Srinivasa, K.G., Venugopal, K.R., Patnaik, L.M.: Self Adaptive Migration Model Genetic Algorithms for Data Mining Applications, Technical Report, University Visvesvaraya College of Engineering, Bangalore University (August 2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Srinivasa, K.G., Sridharan, K., Shenoy, P.D., Venugopal, K.R., Patnaik, L.M. (2005). A Dynamic Migration Model for Self-adaptive Genetic Algorithms. In: Gallagher, M., Hogan, J.P., Maire, F. (eds) Intelligent Data Engineering and Automated Learning - IDEAL 2005. IDEAL 2005. Lecture Notes in Computer Science, vol 3578. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11508069_72

Download citation

  • DOI: https://doi.org/10.1007/11508069_72

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26972-4

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics