Macroevolutionary Algorithms: A New Optimization Method on Fitness Landscapes

This paper introduces a new approach to optimiza- tion problems based on a previous theoretical work on extinction patterns in macroevolution. We name them macroevolutionary algorithms (MA). Unlike population-level evolution, which is employed in standard evolutionary algorithms, evolution at the level of higher taxa is used as the underlying metaphor. The model exploits the presence of links between "species" that represent candidate solutions to the optimization problem. To test its effectiveness, we compare the performance of MA's versus genetic algorithms (GA) with tournament selection. The method is shown to be a good alternative to standard GA's, showing a fast monotonous search over the solution space even for very small population sizes. A mean field theoretical approach is presented showing that the basic dynamics of MA's are close to an ecological model of multispecies competition.