Journal Article10.1007/S00500-019-04565-4
A decomposition-based evolutionary algorithm with adaptive weight adjustment for many-objective problems
Cai Dai,Xiujuan Lei,Xiaoguang He +2 more
- 01 Jul 2020
- Vol. 24, Iss: 14, pp 10597-10609
10
TL;DR: A new decomposition-based evolutionary algorithm with adaptive weight adjustment is designed to obtain a set of solutions with good convergence and diversity in many-objective optimization problems.
read more
Abstract: For many-objective optimization problems (MaOPs), how to get a set of solutions with good convergence and diversity is a difficult and challenging work. In this paper, a new decomposition-based evolutionary algorithm with adaptive weight adjustment is designed to obtain this goal. The proposed algorithm adopts the uniform design method to set the weight vectors which are uniformly distributed over the design space, and an adaptive weight adjustment is used to solve some MaOPs with complex Pareto optimal front (PF) (i.e., PF with a sharp peak of low tail or discontinuous PF). A selection strategy is used to help solutions to converge to the Pareto optimal solutions. Comparing with some efficient state-of-the-art algorithms, e.g., NSGAII-CE, MOEA/D and HypE, on some benchmark functions, the proposed algorithm is able to find more accurate Pareto front with better diversity.
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
Advanced Metaheuristic Techniques for Mechanical Design Problems: Review
TL;DR: This review article demonstrates the applications of different metaheuristic algorithms in enhancing the design process of different mechanical systems.
82
A classification surrogate-assisted multi-objective evolutionary algorithm for expensive optimization
TL;DR: In this article , a classification surrogate-assisted multi-objective evolutionary algorithm (CSA-MOEA) is proposed for expensive optimization, which adopts a classification tree as the surrogate model to predict promising offsprings, which may be non-dominated solutions with good convergence.
36
Multi/many-objective evolutionary algorithm assisted by radial basis function models for expensive optimization
TL;DR: In this paper , a multi-many-objective optimization algorithm assisted by radial basis function is proposed based on reference vectors to solve computationally expensive optimization, where a set of candidates are first determined by the reference vectors guided evolutionary algorithm in a sub-cycle.
21
A Two-stage Surrogate-Assisted Evolutionary Algorithm (TS-SAEA) for Expensive Multi/Many-objective Optimization
TL;DR: In this paper , a two-stage surrogate-assisted evolutionary algorithm (TS-SAEA) is presented for computationally expensive multi-many-objective optimization, which consists of a convergence stage and a diversity stage.
15
Feature Selection Based on a Large-Scale Many-Objective Evolutionary Algorithm.
TL;DR: In this paper, a modified vector angle-based large-scale many-objective evolutionary algorithm (MALSMEA) was proposed to solve the feature selection problem in a large scale feature selection model, where the number of selected features, accuracy, relevance, redundancy, interclass distance, and intraclass distance were considered.
References
•Book
Principles and Procedures of Statistics: A Biometrical Approach
Robert G. D. Steel,James H. Torrie +1 more
- 01 Jun 1980
TL;DR: Observations probability sampling from a normal distribution comparisons involving two sample means principles of experimental design analysis of variance.
16.9K
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.