Bhandari, Dinabandhu ; Murthy, C. A. ; Pal, Sankar K. (1996) Genetic algorithm with elitist model and its convergence International Journal of Pattern Recognition and Artificial Intelligence, 10 (6). pp. 731-747. ISSN 0218-0014
Full text not available from this repository.
Official URL: http://www.worldscinet.com/ijprai/10/1006/S0218001...
Related URL: http://dx.doi.org/10.1142/S0218001496000438
Abstract
In this article, the genetic algorithm with elitist model (EGA) is modeled as a finite state Markov chain. A state in the Markov chain denotes a population together with a potential string. Proof for the convergence of an EGA to the best chromosome (string), among all possible chromosomes, is provided here. Mutation operation has been found to be essential for convergence. It has been shown that an EGA converges to the global optimal solution with any choice of initial population.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to World Scientific Publishing Company. |
| Keywords: | Genetic Algorithms; Markov Chains; Elitist Model; Transition Probability Matrix; Single Point Crossover; Global Optimal String |
| ID Code: | 77669 |
| Deposited On: | 14 Jan 2012 06:00 |
| Last Modified: | 14 Jan 2012 06:00 |
Repository Staff Only: item control page
