DocumentCode
1747772
Title
Towards computing the parameters of the simple genetic algorithm
Author
Jonsson, Roger ; Malec, Jacek
Author_Institution
Dept. of Comput. Eng., Malardalen Univ., Vasteras, Sweden
Volume
1
fYear
2001
fDate
2001
Firstpage
516
Abstract
The problem of finding appropriate probabilities for crossover and mutation with respect to resampling may be addressed using the Markov chain model. Our efforts in this direction lead through a simplification of the mixing matrix incorporating both probabilities. We present the simplification and discuss some of its ramifications. We expect that it may lead to some improvement of the computational properties of the Markov chain model of the simple genetic algorithm
Keywords
Markov processes; genetic algorithms; probability; Markov chain model; crossover probability; mixing matrix; mutation probability; simple genetic algorithm; Biological cells; Computer science; Feedback; Genetic algorithms; Genetic mutations; Probability distribution; Vocabulary;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2001. Proceedings of the 2001 Congress on
Conference_Location
Seoul
Print_ISBN
0-7803-6657-3
Type
conf
DOI
10.1109/CEC.2001.934435
Filename
934435
Link To Document