An analysis of Punctuated Equilibria in Simple Genetic Algorithms

In the running of a genetic algorithm, the population is liable to be conned in the local optimum, that is the metastable state, making an equilibrium. It is known that, after a long time, the equilibrium is punctuated suddenly and the population transits into the better neighbor optimum. We adopt the formalization of Computational Ecosystems to show that the dynamics of the Simple Genetic Algorithm is represented by a dierential equation focusing on the population mean of a phenotype. Referring to the studies of dierential equations of this form, we show that the duration time of metastability is exponential in the population size and other parameters, on the one dimensional bistable fitness landscape which has one metastable and one stable state.
Publisher
Springer Verlag (Germany)
Issue Date
1997-10
Citation

Lecture Notes in Computer Science, v.1363, pp.195-206

ISSN
0302-9743
URI
http://hdl.handle.net/10203/292
Appears in Collection
CS-Conference Papers(학술회의논문)
Files in This Item
An analysis of Punctuated Equilibria in Simple Genetic Algorithms.pdf(361.8 kB)Download
  • Hit : 491
  • Download : 287
  • Cited 0 times in thomson ci

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0