An analysis of punctuated equilibria in simple genetic algorithms

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 238
  • Download : 0
In the running of a genetic algorithm, the population is liable to be confined 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 differential equation focusing on the population mean of a phenotype. Referring to the studies of differential 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.
Issue Date
Article Type
Article; Proceedings Paper
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button


  • mendeley


rss_1.0 rss_2.0 atom_1.0