By Topic

Decomposition-Based Multiobjective Evolutionary Algorithm With an Ensemble of Neighborhood Sizes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Shi-Zheng Zhao ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore, Singapore ; Suganthan, P.N. ; Qingfu Zhang

The multiobjective evolutionary algorithm based on decomposition (MOEA/D) has demonstrated superior performance by winning the multiobjective optimization algorithm competition at the CEC 2009. For effective performance of MOEA/D, neighborhood size (NS) parameter has to be tuned. In this letter, an ensemble of different NSs with online self-adaptation is proposed (ENS-MOEA/D) to overcome this shortcoming. Our experimental results on the CEC 2009 competition test instances show that an ensemble of different NSs with online self-adaptation yields superior performance over implementations with only one fixed NS.

Published in:

Evolutionary Computation, IEEE Transactions on  (Volume:16 ,  Issue: 3 )