DocumentCode
296230
Title
A new Markov chain analysis for a GA using symbolic representation
Author
Chung, Weon Sam ; Perez, Rafael ; Lee, Eun Ryung
Volume
1
fYear
1995
fDate
Nov. 29 1995-Dec. 1 1995
Firstpage
356
Abstract
A new Markov chain model for a GA using symbolic representation (SymGA) is proposed. Based on the newly proposed Markov chain model, the search behavior of the SymGA is explained. As long as the mutation operator is employed, our Markov chain for the SymGA is regular. Using this model, we show that the stochastic search behavior of the SymGA is independent of the initial population, and the SymGA converges to the optimal state with a certain probability as the number of trials increases
Keywords
Computer science; Genetic algorithms; Genetic mutations; Stochastic processes;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 1995., IEEE International Conference on
Conference_Location
Perth, WA, Australia
Print_ISBN
0-7803-2759-4
Type
conf
DOI
10.1109/ICEC.1995.489173
Filename
489173
Link To Document