A dynamic Migration Model for self-adaptive Genetic Algorithms

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

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). © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

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 Lecture Notes in Computer Science (Vol. 3578, pp. 555–562). Springer Verlag. https://doi.org/10.1007/11508069_72

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