Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Towards computing the parameters of the simple genetic algorithm

In English

Författare

Summary, in English

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.

Avdelning/ar

  • Computer Science

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 - Institute of Electrical and Electronics Engineers Inc.

Ämne

  • Computer Science

Nyckelord

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

Conference name

CEC2001, Congress on Evolutionary Computation

Conference date

2001-05-27 - 2001-05-31

Conference place

Seoul, Korea, Republic of

Status

Published

ISBN/ISSN/Övrigt

  • ISBN: 0-7803-6657-3