A hybrid macroevolutionary algorithm

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

Abstract

Macroevolutionary algorithm (MA) is a new approach to optimization problems based on extinction patterns in macroevolution. It is different from the traditional population-level evolutionary algorithms such as genetic algorithms. In MAs, evolves at the level of higher taxa is used as the underlying metaphor. It is inspired by the latest models about evolution at large scale-macroevolution, while the traditional evolutionary algorithms are inspired in natural selection of darwinian theory. The MA model exploits the presence of links between "species" that represent candidate solutions to the optimization problem. In this paper, a hybrid MA which combines simulated annealing is proposed to solve complicated multi-modal optimization problems. Numerical simulation results show the power of this hybrid algorithm. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Zhang, J., & Xu, J. (2005). A hybrid macroevolutionary algorithm. In Lecture Notes in Computer Science (Vol. 3612, pp. 299–308). Springer Verlag. https://doi.org/10.1007/11539902_35

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