Image de couverture de livre

A Crowding Distance That Provably Solves the Difficulties of the NSGA-II in Many-Objective Optimization

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Zheng, Weijie, Gao, Yao, Doerr, Benjamin
Format:	Preprint
Publié:	2024
Sujets:	Neural and Evolutionary Computing Artificial Intelligence
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency For Many Objectives
par: Zheng, Weijie, et autres
Publié: (2022)

Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)
par: Zheng, Weijie, et autres
Publié: (2022)

Difficulties of the NSGA-II with the Many-Objective LeadingOnes Problem
par: Doerr, Benjamin, et autres
Publié: (2024)

Runtime Analysis for the NSGA-II: Provable Speed-Ups From Crossover
par: Doerr, Benjamin, et autres
Publié: (2022)

Theoretical Analyses of Multiobjective Evolutionary Algorithms on Multimodal Objectives
par: Zheng, Weijie, et autres
Publié: (2020)

Runtime Analysis of the SMS-EMOA for Many-Objective Optimization
par: Zheng, Weijie, et autres
Publié: (2023)

Proven Approximation Guarantees in Multi-Objective Optimization: SPEA2 Beats NSGA-II
par: Alghouass, Yasser, et autres
Publié: (2025)

The First Theoretical Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm III (NSGA-III)
par: Deng, Renzhong, et autres
Publié: (2025)

Scalable Speed-ups for the SMS-EMOA from a Simple Aging Strategy
par: Li, Mingfeng, et autres
Publié: (2025)

A First Runtime Analysis of the NSGA-II on a Multimodal Problem
par: Doerr, Benjamin, et autres
Publié: (2022)

Already Moderate Population Sizes Provably Yield Strong Robustness to Noise
par: Antipov, Denis, et autres
Publié: (2024)

Speeding Up the NSGA-II via Dynamic Population Sizes
par: Doerr, Benjamin, et autres
Publié: (2025)

Speeding Up the NSGA-II With a Simple Tie-Breaking Rule
par: Doerr, Benjamin, et autres
Publié: (2024)

Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms
par: Wietheger, Simon, et autres
Publié: (2024)

On the Impact of Crossover in Many-Objective Optimization: A Runtime Analysis of NSGA-III
par: Opris, Andre
Publié: (2026)

First Mathematical Runtime Analyses of Multi-Objective Evolutionary Algorithms for Multi-Valued Decision Variables
par: Li, Mingfeng, et autres
Publié: (2026)

Lower Bounds from Fitness Levels Made Easy
par: Doerr, Benjamin, et autres
Publié: (2021)

An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics
par: Bambury, Henry, et autres
Publié: (2021)

Lazy Parameter Tuning and Control: Choosing All Parameters Randomly From a Power-Law Distribution
par: Antipov, Denis, et autres
Publié: (2021)

A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis
par: Doerr, Benjamin, et autres
Publié: (2024)

Runtime Analysis for Permutation-based Evolutionary Algorithms
par: Doerr, Benjamin, et autres
Publié: (2022)

Stochastic Population Update Can Provably Be Helpful in Multi-Objective Evolutionary Algorithms
par: Bian, Chao, et autres
Publié: (2023)

When Switching Algorithms Helps: A Theoretical Study of Online Algorithm Selection
par: Antipov, Denis, et autres
Publié: (2026)

Improved Runtime Guarantees for the SPEA2 Multi-Objective Optimizer
par: Doerr, Benjamin, et autres
Publié: (2025)

Evolution of Thought: Diverse and High-Quality Reasoning via Multi-Objective Optimization
par: Qi, Biqing, et autres
Publié: (2024)

Few for Many: Tchebycheff Set Scalarization for Many-Objective Optimization
par: Lin, Xi, et autres
Publié: (2024)

GPU-accelerated Evolutionary Many-objective Optimization Using Tensorized NSGA-III
par: Li, Hao, et autres
Publié: (2025)

RDEx-SOP: Exploitation-Biased Reconstructed Differential Evolution for Fixed-Budget Bound-Constrained Single-Objective Optimization
par: Tao, Sichen, et autres
Publié: (2026)

Archive-based Single-Objective Evolutionary Algorithms for Submodular Optimization
par: Neumann, Frank, et autres
Publié: (2024)

Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces
par: Doerr, Benjamin, et autres
Publié: (2024)

The Runtime of Random Local Search on the Generalized Needle Problem
par: Doerr, Benjamin, et autres
Publié: (2024)

Hyper-Heuristics Can Profit From Global Variation Operators
par: Doerr, Benjamin, et autres
Publié: (2024)

Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus
par: Doerr, Benjamin, et autres
Publié: (2023)

Optimal Distribution of Solutions for Crowding Distance on Linear Pareto Fronts of Two-Objective Optimization Problems
par: Ishibuchi, Hisao, et autres
Publié: (2025)

Pareto-NRPA: A Novel Monte-Carlo Search Algorithm for Multi-Objective Optimization
par: Lallouet, Noé, et autres
Publié: (2025)

METAFOR: A Hybrid Metaheuristics Software Framework for Single-Objective Continuous Optimization Problems
par: Camacho-Villalón, Christian, et autres
Publié: (2025)

Sliding Window 3-Objective Pareto Optimization for Problems with Chance Constraints
par: Neumann, Frank, et autres
Publié: (2024)

Selection Hyper-heuristics Can Automatically Adjust the Learning Period to Optimally Solve Pseudo-Boolean Problems
par: Doerr, Benjamin, et autres
Publié: (2026)

Customized Exploration of Landscape Features Driving Multi-Objective Combinatorial Optimization Performance
par: Nikolikj, Ana, et autres
Publié: (2025)

A Systematic Survey on Large Language Models for Evolutionary Optimization: From Modeling to Solving
par: Zhang, Yisong, et autres
Publié: (2025)