A taxonomy of online stopping criteria for multi-objective evolutionary algorithms

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

Abstract

The use of multi-objective evolutionary algorithms for solving black-box problems with multiple conflicting objectives has become an important research area. However, when no gradient information is available, the examination of formal convergence or optimality criteria is often impossible. Thus, sophisticated heuristic online stopping criteria (OSC) have recently become subject of intensive research. In order to establish formal guidelines for a systematic research, we present a taxonomy of OSC in this paper. We integrate the known approaches within the taxonomy and discuss them by extracting their building blocks. The formal structure of the taxonomy is used as a basis for the implementation of a comprehensive MATLAB toolbox. Both contributions, the formal taxonomy and the MATLAB implementation, provide a framework for the analysis and evaluation of existing and new OSC approaches. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Wagner, T., Trautmann, H., & Martí, L. (2011). A taxonomy of online stopping criteria for multi-objective evolutionary algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6576 LNCS, pp. 16–30). https://doi.org/10.1007/978-3-642-19893-9_2

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