.png){kind=icon}
.png){kind=icon}
Return
ADEMO/D: Multiobjective optimization by an adaptive differential evolution algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2013.06.043.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents an approach for continuous optimization called Adaptive Differential Evolution for Multiobjective Problems (ADEMO/D). The approach incorporates concepts of Multiobjective Evolutionary Algorithms based on Decomposition (MOEA/D) and mechanisms of strategies adaptation. In this work we test two methods to perform adaptive strategy selection: Probability Matching (PM) and Adaptive Pursuit (AP). PM and AP are analyzed in combination with four credit assignment techniques based on relative fitness improvements. The DE strategy is chosen from a candidate pool according to a probability that depends on its previous experience in generating promising solutions. In experiments, we evaluate certain features of the proposed approach, considering eight different versions while solving a well established set of 10 instances of Multiobjective Optimization Problems. Next the best-so-far version (ADEMO/D) is confronted with its non-adaptive counterparts. Finally ADEMO/D is compared with four important multiobjective optimization algorithms in the same application context. Pareto compliant indicators and statistical tests are applied to evaluate the algorithm performances. The preliminary results are very promising and stand ADEMO/D as a candidate to the state-of-the-art for multiobjective optimization. (C) 2013 Elsevier B.V. All rights reserved.
Keywords:
Multiobjective optimization
Adaptive differential evolution
Probability matching
Adaptive pursuit
Credit assignment
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W