Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

Towards computing the parameters of the simple genetic algorithm

Malec, Jacek LU orcid and Jonsson, Roger (2001) CEC2001, Congress on Evolutionary Computation 1. p.516-520
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:
author
and
organization
publishing date
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
host publication
Proceedings of the 2001 Congress on Evolutionary Computation
volume
1
pages
516 - 520
publisher
IEEE - Institute of Electrical and Electronics Engineers Inc.
conference name
CEC2001, Congress on Evolutionary Computation
conference location
Seoul, Korea, Republic of
conference dates
2001-05-27 - 2001-05-31
external identifiers
  • scopus:0034862424
ISBN
0-7803-6657-3
DOI
10.1109/CEC.2001.934435
language
English
LU publication?
yes
id
d01d17ee-e4d1-41fd-8629-5cf722531fd6 (old id 526526)
date added to LUP
2016-04-04 10:35:38
date last changed
2022-01-29 20:31:36
@inproceedings{d01d17ee-e4d1-41fd-8629-5cf722531fd6,
  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}},
  booktitle    = {{Proceedings of the 2001 Congress on Evolutionary Computation}},
  isbn         = {{0-7803-6657-3}},
  keywords     = {{mutation probability; genetic algorithms; crossover probability; Markov processes; mixing matrix; probability; Markov chain model; simple genetic algorithm}},
  language     = {{eng}},
  pages        = {{516--520}},
  publisher    = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
  title        = {{Towards computing the parameters of the simple genetic algorithm}},
  url          = {{http://dx.doi.org/10.1109/CEC.2001.934435}},
  doi          = {{10.1109/CEC.2001.934435}},
  volume       = {{1}},
  year         = {{2001}},
}