A Fuzzy Decomposition-Based Multi/Many-Objective Evolutionary Algorithm
- 4 August 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 52 (5) , 3495-3509
Abstract
Performance of multi/many-objective evolutionary algorithms (MOEAs) based on decomposition is highly impacted by the Pareto front (PF) shapes of multi/many-objective optimization problems (MOPs), as their adopted weight vectors may not properly fit the PF shapes. To avoid this mismatch, some MOEAs treat solutions as weight vectors to guide the evolutionary search, which can adapt to the target MOP's PF automatically. However, their performance is still affected by the similarity metric used to select weight vectors. To address this issue, this article proposes a fuzzy decomposition-based MOEA. First, a fuzzy prediction is designed to estimate the population's shape, which helps to exactly reflect the similarities of solutions. Then, N least similar solutions are extracted as weight vectors to obtain N constrained fuzzy subproblems (N is the population size), and accordingly, a shared weight vector is calculated for all subproblems to provide a stable search direction. Finally, the corner solution for each of m least similar subproblems (m is the objective number) is preserved to maintain diversity, while one solution having the best aggregated value on the shared weight vector is selected for each of the remaining subproblems to speed up convergence. When compared to several competitive MOEAs in solving a variety of test MOPs, the proposed algorithm shows some advantages at fitting their different PF shapes.Keywords
Funding Information
- National Natural Science Foundation of China (61876110, 61836005)
- Joint Funds of the NNFC under Key Program (U1713212)
- NSFC (61876162)
- Shenzhen Scientific Research and Development Funding Program (JCYJ20180307123637294, JCYJ20190808164211203)
- CONACyT Project 1920
- SEP-Cinvestav 2018 Project
This publication has 70 references indexed in Scilit:
- A Study on the Specification of a Scalarizing Function in MOEA/D for Many-Objective Knapsack Problems2013
- An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box ConstraintsIEEE Transactions on Evolutionary Computation, 2013
- HypE: An Algorithm for Fast Hypervolume-Based Many-Objective OptimizationEvolutionary Computation, 2011
- KEEL: a software tool to assess evolutionary algorithms for data mining problemsSoft Computing, 2008
- Pareto-adaptive ε-dominanceEvolutionary Computation, 2007
- A Scalable Multi-objective Test Problem Toolkit2005
- The balance between proximity and diversity in multiobjective evolutionary algorithmsIEEE Transactions on Evolutionary Computation, 2003
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approachIEEE Transactions on Evolutionary Computation, 1999
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization ProblemsSIAM Journal on Optimization, 1998