Comparing decomposition-based and automatically component-wise designed multi-objective evolutionary algorithms

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

Abstract

A main focus of current research on evolutionary multiobjective optimization (EMO) is the study of the effectiveness of EMO algorithms for problems with many objectives. Among the several techniques that have led to the development of more effective algorithms, decomposition and component-wise design have presented particularly good results. But how do they compare? In this work, we conduct a systematic analysis that compares algorithms produced using the MOEA/D decomposition-based framework and the AutoMOEA component-wise design framework. In particular, we identify a version of MOEA/D that outperforms the best known MOEA/D algorithm for several scenarios and confirms the effectiveness of decomposition on problems with three objectives. However, when we consider problems with five objectives, we show that MOEA/D is unable to outperform SMS-EMOA, being often outperformed by it. Conversely, automatically designed AutoMOEAs display competitive performance on three-objective problems, and the best and most robust performance among all algorithms considered for problems with five objectives.

Cite

CITATION STYLE

APA

Bezerra, L. C. T., López-Ibáñez, M., & Stützle, T. (2015). Comparing decomposition-based and automatically component-wise designed multi-objective evolutionary algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9018, pp. 396–410). Springer Verlag. https://doi.org/10.1007/978-3-319-15934-8_27

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