Journal Article10.1109/TEVC.2020.2978158
A Survey of Weight Vector Adjustment Methods for Decomposition-Based Multiobjective Evolutionary Algorithms
154
TL;DR: A comprehensive survey of weight vector adjustment methods covering the weight vector adaptation strategies, theoretical analyses, benchmark test problems, and applications for multiobjective evolutionary algorithms based on decomposition is presented.
read more
Abstract: Multiobjective evolutionary algorithms based on decomposition (MOEA/D) have attracted tremendous attention and achieved great success in the fields of optimization and decision-making. MOEA/Ds work by decomposing the target multiobjective optimization problem (MOP) into multiple single-objective subproblems based on a set of weight vectors. The subproblems are solved cooperatively in an evolutionary algorithm framework. Since weight vectors define the search directions and, to a certain extent, the distribution of the final solution set, the configuration of weight vectors is pivotal to the success of MOEA/Ds. The most straightforward method is to use predefined and uniformly distributed weight vectors. However, it usually leads to the deteriorated performance of MOEA/Ds on solving MOPs with irregular Pareto fronts. To deal with this issue, many weight vector adjustment methods have been proposed by periodically adjusting the weight vectors in a random, predefined, or adaptive way. This article focuses on weight vector adjustment on a simplex and presents a comprehensive survey of these weight vector adjustment methods covering the weight vector adaptation strategies, theoretical analyses, benchmark test problems, and applications. The current limitations, new challenges, and future directions of weight vector adjustment are also discussed.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Large-scale multiobjective optimization with adaptive competitive swarm optimizer and inverse modeling
TL;DR: In this paper , an adaptive competitive swarm optimizer with inverse modeling is developed, where an adaptive parameter model is designed to accelerate the convergence speed when the population not traps in local convergence.
13
Decomposition-based Multi-objective Optimization Algorithms with Adaptively Adjusting Weight Vectors and Neighborhoods
TL;DR: In this paper , a decomposition-based multi-objective optimization algorithm with adaptively adjusting weight vectors and neighborhoods (MOEA/D-AAWN) is developed, where the evolutionary direction of each subproblem is analyzed and the Sparsity function (Spa) is proposed to measure the population density on the PF.
13
An information entropy-driven evolutionary algorithm based on reinforcement learning for many-objective optimization
Peng Liang,Yangtao Chen,Ting Huang,Wei Li +3 more
TL;DR: This paper proposes RL-RVEA, an information entropy-driven evolutionary algorithm based on reinforcement learning for many-objective optimization with irregular Pareto fronts, leveraging RL to adaptively adjust reference vectors and balance competing objectives.
12
A Localized High-Fidelity-Dominance based Many-Objective Evolutionary Algorithm
TL;DR: In this article , a localized high-fidelity-dominance-based EA (LHFiD) is proposed to factor all the three human decision-making (HDM) elements explicitly and simultaneously, without requiring tuning of any parameter.
12
A multiobjective state transition algorithm based on modified decomposition method
TL;DR: In this article , a new multiobjective state transition algorithm based on modified decomposition method (MOSTA/D) is proposed, which employs vectorial angles between weight vectors and candidate solutions.
References
•Book
Multi-Objective Optimization Using Evolutionary Algorithms
Kalyanmoy Deb,Deb Kalyanmoy +1 more
- 01 Jan 2001
TL;DR: This text provides an excellent introduction to the use of evolutionary algorithms in multi-objective optimization, allowing use as a graduate course text or for self-study.
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
Qingfu Zhang,Hui Li +1 more
TL;DR: Experimental results have demonstrated that MOEA/D with simple decomposition methods outperforms or performs similarly to MOGLS and NSGA-II on multiobjective 0-1 knapsack problems and continuous multiobjectives optimization problems.
An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints
Kalyanmoy Deb,Himanshu Jain +1 more
TL;DR: A reference-point-based many-objective evolutionary algorithm that emphasizes population members that are nondominated, yet close to a set of supplied reference points is suggested that is found to produce satisfactory results on all problems considered in this paper.
•Book
Nonlinear Multiobjective Optimization
Kaisa Miettinen
- 26 Sep 2011
TL;DR: This paper is concerned with the development of methods for dealing with the role of symbols in the interpretation of semantics.
5.6K
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
TL;DR: This paper provides a systematic comparison of various evolutionary approaches to multiobjective optimization using six carefully chosen test functions and shows that elitism is shown to be an important factor for improving evolutionary multiobjectives search.