Journal Article10.1016/j.ins.2024.120200
A cascading elimination-based evolutionary algorithm with variable classification mutation for many-objective optimization
Wei Zhang,Jianchang Liu,Wanting Yang,Shubin Tan +3 more
1
TL;DR: This paper proposes CEEA, a many-objective evolutionary algorithm that balances convergence and diversity through a cascading elimination mechanism and variable classification mutation, outperforming peers on various benchmark test suites and real-world applications.
read more
Abstract: Many-objective evolutionary algorithms have gained significant achievements over the years. However, the difficulty in balancing convergence and diversity of the population remains. In this paper, we propose a cascading elimination based evolutionary algorithm with variable classification mutation, termed CEEA, for many-objective optimization. In CEEA, a cascading elimination mechanism based on the binary quality indicator and balanceable fitness estimation (BFE) is proposed for eliminating poor individuals one by one and further balancing convergence and diversity of the population. To be specific, two individuals with the minimum binary quality indicator value are found from the population, where these two individuals may exist in the dominance relation and have more similar search directions. If the relation of two selected individuals is dominance, the dominated individual is eliminated. Otherwise, one individual is eliminated by the BFE method. In addition, a binary quality indicator based variable classification mutation strategy is developed to produce promising individuals, and further improve the search efficiency of CEEA. Experimental studies on three well-known benchmark test suites, a combinational optimization problem, and a real-world engineering application have demonstrated that our CEEA has a superior performance to its peer competitors on various many-objective problems.
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
A two-stage evolutionary algorithm assisted by multi-archives for constrained multi-objective optimization
Dantong Li,Jianchang Liu,Wei Zhang,Yuanchao Liu,Shubin Tan +4 more
TL;DR: A two-stage evolutionary algorithm assisted by multi-archives for constrained multi-objective optimization (MA-TSEA) improves the exploration and convergence abilities of CMOEAs by dividing the evolution process into two stages and utilizing multi-archives.
1
References
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.
•Journal Article
Simulated Binary Crossover for Continuous Search Space.
TL;DR: A real-coded crossover operator is developed whose search power is similar to that of the single-point crossover used in binary-coded GAs, and SBX is found to be particularly useful in problems having mult ip le optimal solutions with a narrow global basin where the lower and upper bo unds of the global optimum are not known a priori.
3.3K
Hype: An algorithm for fast hypervolume-based many-objective optimization
Johannes Bader,Eckart Zitzler +1 more
TL;DR: This paper presents HypE, a hypervolume estimation algorithm for multi-objective optimization, by which the accuracy of the estimates and the available computing resources can be traded off; thereby, not only do many-Objective problems become feasible with hypervolume-based search, but also the runtime can be flexibly adapted.
2K
A review of multiobjective test problems and a scalable test problem toolkit
TL;DR: This paper systematically review and analyze many problems from the EA literature, each belonging to the important class of real-valued, unconstrained, multiobjective test problems, and presents a flexible toolkit for constructing well-designed test problems.