The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Towards computing the parameters of the simple genetic algorithm

På svenska

Author

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.

Department/s

  • Computer Science

Publishing year

2001

Language

English

Pages

516-520

Publication/Series

Proceedings of the 2001 Congress on Evolutionary Computation

Volume

1

Document type

Conference paper

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Computer Science

Keywords

  • 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/Other

  • ISBN: 0-7803-6657-3