Journal
SOFT COMPUTING
Volume 22, Issue 23, Pages 7833-7846Publisher
SPRINGER
DOI: 10.1007/s00500-018-3499-9
Keywords
Reproduction method; Decomposition; Multiobjective optimization
Categories
Funding
- National Nature Science Foundation of China [61773296]
- 111 Programme of Introducing Talents of Discipline to Universities [B07037]
- Fundamental Research Funds for the Central Universities [2042018kf0224]
- Research Fund for Academic Team of Young Scholars at Wuhan University [Whu2016013]
Ask authors/readers for more resources
Multiobjective evolutionary algorithms based on decomposition (MOEA/D) decompose a multiobjective optimization problem (MOP) into a group of subproblems and optimizes them at the same time. The reproduction method in MOEA/D, which generates offspring solutions, has crucial effect on the performance of algorithm. As the difficulties of MOPs increases, it requires much higher efficiency for the reproduction methods in MOEA/D. However, for the complex optimization problems whose PS shape is complicated, the original reproduction method used in MOEA/D might not be suitable to generate excellent offspring solutions. In order to improve the property of the reproduction method for MOEA/D, this paper proposes an external archive matching strategy which selects solutions' most matching archive solutions as parent solutions. The offspring solutions generated by this strategy can maintain a good convergence ability. To balance convergence and diversity, a perturbed learning scheme is used to extend the search space of the solutions. The experimental results on three groups of test problems reveal that the solutions obtained by MOEA/D-EAM have better convergence and diversity than the other four state-of-the-art algorithms.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available