Self-organized criticality and mass extinction in evolutionary algorithms

42Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The gaps in the fossil record gave rise to the hypothesis that evolution proceeded in long periods of stasis, which alternated with occasional, rapid changes that yielded evolutionary progress. One mechanism that could cause these punctuated bursts is the recolonization of changing and deserted niches after mass extinction events. Furthermore, paleontological studies have shown that there is a power law relationship between the frequency of species extinction events and the size of the extinction impact. Power law relationships of this kind are typical for complex systems, which operate at a critical state between chaos and order, known as self-organized criticality (SOC). Based on this background, we used SOC to control the size of spatial extinction zones in a diffusion model. The SOC selection process was easy to implement and implied only negligible computational costs. Our results show that the SOC spatial extinction model clearly outperforms simple evolutionary algorithms (EAs) and the diffusion mo del (CGA). Further, our results support the biological hypothesis that mass extinctions might play an important role in evolution. However, the success of simple EAs indicates that evolution would already be a powerful optimization process without mass extinction, though probably slower and with less perfect adaptations.

Cite

CITATION STYLE

APA

Krink, T., & Thomsen, R. (2001). Self-organized criticality and mass extinction in evolutionary algorithms. In Proceedings of the IEEE Conference on Evolutionary Computation, ICEC (Vol. 2, pp. 1155–1161). https://doi.org/10.1109/cec.2001.934321

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free