Towards computing the parameters of the simple genetic algorithm
(2001) CEC2001, Congress on Evolutionary Computation In Proceedings of the 2001 Congress on Evolutionary Computation 1. p.516520 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.
Please use this url to cite or link to this publication:
http://lup.lub.lu.se/record/526526
 author
 Malec, Jacek ^{LU} and Jonsson, Roger
 organization
 publishing date
 2001
 type
 Chapter in Book/Report/Conference proceeding
 publication status
 published
 subject
 keywords
 mutation probability, genetic algorithms, crossover probability, Markov processes, mixing matrix, probability, Markov chain model, simple genetic algorithm
 in
 Proceedings of the 2001 Congress on Evolutionary Computation
 volume
 1
 pages
 516  520
 publisher
 IEEEInstitute of Electrical and Electronics Engineers Inc.
 conference name
 CEC2001, Congress on Evolutionary Computation
 external identifiers

 Scopus:0034862424
 ISBN
 0780366573
 DOI
 10.1109/CEC.2001.934435
 language
 English
 LU publication?
 yes
 id
 d01d17eee4d141fd86295cf722531fd6 (old id 526526)
 date added to LUP
 20070924 08:52:09
 date last changed
 20161013 04:40:50
@misc{d01d17eee4d141fd86295cf722531fd6, 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.}, author = {Malec, Jacek and Jonsson, Roger}, isbn = {0780366573}, keyword = {mutation probability,genetic algorithms,crossover probability,Markov processes,mixing matrix,probability,Markov chain model,simple genetic algorithm}, language = {eng}, pages = {516520}, publisher = {ARRAY(0xb0118e8)}, series = {Proceedings of the 2001 Congress on Evolutionary Computation}, title = {Towards computing the parameters of the simple genetic algorithm}, url = {http://dx.doi.org/10.1109/CEC.2001.934435}, volume = {1}, year = {2001}, }