Optimization Online


Comparison Between NSGA-II and MOEA/D on a Set of Multiobjective Optimization Problems with Complicated Pareto Sets

Hui Li (hlil***at***essex.ac.uk)
Qingfu Zhang (qzhang***at***essex.ac.uk)

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 MOEAs for dealing with complicated PS shapes. It also proposes a new version of MOEA/D, i.e., MOEA/D-DE and compares it with NSGA-II with the same reproduction operators on the test instances introduced in this paper. The experimental esults 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.

Keywords: multiobjective optimization, test problems, Pareto Set

Category 1: Other Topics (Multi-Criteria Optimization )

Citation: This paper has been accepted by IEEE Transactions on Evolutionary Computation.


Entry Submitted: 11/05/2007
Entry Accepted: 11/13/2007
Entry Last Modified: 04/15/2008

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society