Analysis of coevolution for worst-case optimization

Authors:
Philipp Stuermer;Anthony Bucci;Juergen Branke;Pablo Funes;Elena Popovici
Affiliations:
University of Karlsruhe, Karlsruhe, Germany;Icosystem Corporation, Cambridge, MA, USA;University of Karlsruhe, Karlsruhe, Germany;Icosystem Corporation, Cambridge, MA, USA;Icosystem Corporation, Cambridge, MA, USA
Venue:
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Year:
2009

Citing 5
Cited 2

A new look at solving minimax problems with coevolutionary genetic algorithms

Metaheuristics
Solution concepts in coevolutionary algorithms

Solution concepts in coevolutionary algorithms
Unbiased coevolutionary solution concepts

Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Monotonicity versus performance in co-optimization

Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Coevolutionary free lunches

IEEE Transactions on Evolutionary Computation

On the practicality of optimal output mechanisms for co-optimization algorithms

Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
The global financial markets: an ultra-large-scale systems perspective

Proceedings of the 17th Monterey conference on Large-Scale Complex IT Systems: development, operation and management

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of finding entities with the best worst-case performance across multiple scenarios arises in domains ranging from job shop scheduling to designing physical artifacts. In spite of previous successful applications of evolutionary computation techniques, particularly coevolution, to such domains, little work has examined utilizing coevolution for optimizing worst-case behavior. Previous work assesses certain algorithm mechanisms using aggregate performance on test problems. We examine fitness and population trajectories of individual algorithm runs, making two observations: first, that aggregate plots wash out important effects that call into question what these algorithms can produce; and second, that none of the mechanisms is generally better than the rest. More importantly, our dynamics analysis explains how the interplay of algorithm properties and problem properties influences performance. These contributions argue in favor of a reassessment of what makes for a good worst-case coevolutionary algorithm and suggest how to design one.