A multiobjective differential evolution based on decomposition for multiobjective optimization with variable linkages

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

Abstract

Although a number of multiobjective evolutionary algorithms have been proposed over the last two decades, not much effort has been made to deal with variable linkages in multiobjective optimization. Recently, we have suggested a general framework of multiobjective evolutionary algorithms based on decomposition (MOEA/D) [1]. MOEA/D decomposes a MOP into a number of scalar optimization subproblems by a conventional decomposition method. The optimal solution to each of these problems is a Pareto optimal solution to the MOP under consideration. An appropriate decomposition could make these individual Pareto solutions evenly distribute along the Pareto optimal front. MOEA/D aims at solving these scalar optimization subproblems simultaneously. In this paper, we propose, under the framework of MOEA/D, a multiobjective differential evolution based decomposition (MODE/D) for tackling variable linkages. Our experimental results show that MODE/D outperforms several other MOEAs on several test problems with variable linkages. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Li, H., & Zhang, Q. (2006). A multiobjective differential evolution based on decomposition for multiobjective optimization with variable linkages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4193 LNCS, pp. 583–592). Springer Verlag. https://doi.org/10.1007/11844297_59

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