Du är här

Towards computing the parameters of the simple genetic algorithm

Författare:
Publiceringsår: 2001
Språk: Engelska
Sidor: 516-520
Publikation/Tidskrift/Serie: Proceedings of the 2001 Congress on Evolutionary Computation
Volym: 1
Dokumenttyp: Konferensbidrag
Förlag: IEEE

Sammanfattning

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.

Disputation

Nyckelord

  • Technology and Engineering
  • mutation probability
  • genetic algorithms
  • crossover probability
  • Markov processes
  • mixing matrix
  • probability
  • Markov chain model
  • simple genetic algorithm

Övriga

CEC2001, Congress on Evolutionary Computation
2001-05-27/2001-05-31
Seoul , South Korea
Published
Yes
  • ISBN: 0-7803-6657-3

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

LERU logotype U21 logotype

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen