Research Repository

Multiobjective optimization problems with complicated pareto sets, MOEA/ D and NSGA-II

Li, H and Zhang, Q (2009) 'Multiobjective optimization problems with complicated pareto sets, MOEA/ D and NSGA-II.' IEEE Transactions on Evolutionary Computation, 13 (2). 284 - 302. ISSN 1089-778X

[img] PDF (Paper)
LiZhang2007.pdf
Restricted to Repository staff only

Download (3MB)
[img] Archive (ZIP) (C++ code)
MOEA-D-DE.rar
Restricted to Repository staff only

Download (141kB)

Abstract

Partly due to lack of test problems, the impact of the Pareto set (PS) shapes on the performance of evolutionary algorithms has not yet attracted much attention. This paper introduces a general class of continuous multiobjective optimization test instances with arbitrary prescribed PS shapes, which could be used for studying the ability of multiobjective evolutionary algorithms for dealing with complicated PS shapes. It also proposes a new version of MOEA/D based on differential evolution (DE), i.e., MOEA/D-DE, and compares the proposed algorithm with NSGA-II with the same reproduction operators on the test instances introduced in this paper. The experimental results indicate that MOEA/D could significantly outperform NSGA-II on these test instances. It suggests that decomposition based multiobjective evolutionary algorithms are very promising in dealing with complicated PS shapes. © 2008 IEEE.

Item Type: Article
Subjects: Q Science > QA Mathematics
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Science and Health > Computer Science and Electronic Engineering, School of
Depositing User: Jim Jamieson
Date Deposited: 13 Jan 2012 11:23
Last Modified: 17 Oct 2019 14:17
URI: http://repository.essex.ac.uk/id/eprint/1973

Actions (login required)

View Item View Item