Two-Archive Evolutionary Algorithm for Constrained Multi-Objective Optimization
When solving constrained multi-objective optimization problems, an important issue is how to balance convergence, diversity and feasibility simultaneously. To address this issue, this paper proposes a parameter-free constraint handling technique, two-archive evolutionary algorithm, for constrained multi-objective optimization. It maintains two co-evolving populations simultaneously: one, denoted as convergence archive, is the driving force to push the population toward the Pareto front; the other one, denoted as diversity archive, mainly tends to maintain the population diversity. In particular, to complement the behavior of the convergence archive and provide as much diversified information as possible, the diversity archive aims at exploring areas under-exploited by the convergence archive including the infeasible regions. To leverage the complementary effects of both archives, we develop a restricted mating selection mechanism that adaptively chooses appropriate mating parents from them according to their evolution status. Comprehensive experiments on a series of benchmark problems and a real-world case study fully demonstrate the competitiveness of our proposed algorithm, comparing to five state-of-the-art constrained evolutionary multi-objective optimizers.
Code (0)
등록된 구현이 없습니다.
Tasks
DiversityVocal Bursts Valence PredictionSimilar Papers 제목 키워드 기반
An Improved Two-Archive Evolutionary Algorithm for Constrained Multi-Objective Optimization
Constrained multi-objective optimization problems (CMOPs) are ubiquitous in real-world engineering optimization scenarios. A key issue in constrained multi-objective optimization is to strike a balance among convergence,…
DiversityVocal Bursts Valence PredictionTRUST-TAEA: A trustworthiness-guided two-archive evolutionary algorithm with variable-grouping sparse search for large-scale multi-objective optimization
Large-scale multi-objective optimization problems (LSMOPs) remain challenging due to the high-dimensional decision spaces, complex variable interactions, and limited function evaluation budgets, which make it difficult t…
Archive-based Single-Objective Evolutionary Algorithms for Submodular Optimization
Constrained submodular optimization problems play a key role in the area of combinatorial optimization as they capture many NP-hard optimization problems. So far, Pareto optimization approaches using multi-objective form…
Combinatorial OptimizationEvolutionary AlgorithmsA Multi-operator Ensemble LSHADE with Restart and Local Search Mechanisms for Single-objective Optimization
In recent years, multi-operator and multi-method algorithms have succeeded, encouraging their combination within single frameworks. Despite promising results, there remains room for improvement as only some evolutionary …
Evolutionary AlgorithmsNot Just for Archiving: Provable Benefits of Reusing the Archive in Evolutionary Multi-objective Optimization
Evolutionary Algorithms (EAs) have become the most popular tool for solving widely-existed multi-objective optimization problems. In Multi-Objective EAs (MOEAs), there is increasing interest in using an archive to store …