Convergence rates of (1+1) evolutionary multiobjective optimization algorithms

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

Abstract

Convergence analyses of evolutionary multiobjective optimization algorithms typically deal with the convergence in limit (stochastic convergence) or the run time. Here, for the first time concrete results for convergence rates of several popular algorithms on certain classes of continuous functions are presented. We consider the algorithms in the version of using a (1+1) selection scheme. Then, SMS-EMOA and IBEAε+ achieve linear convergence rate, proved by showing algorithmic equivalence to the single-objective (1+1)-EA with self-adaptation, whereas NSGA-II and SPEA2 have a sub-linear convergence rate, proved by reducing them to a multiobjective algorithm with known properties. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Beume, N., Laumanns, M., & Rudolph, G. (2010). Convergence rates of (1+1) evolutionary multiobjective optimization algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6238 LNCS, pp. 597–606). https://doi.org/10.1007/978-3-642-15844-5_60

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