Image de couverture de livre

A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Doerr, Benjamin, Knowles, Joshua, Neumann, Aneta, Neumann, Frank
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

Theoretical Analysis of Quality Diversity Algorithms for a Classical Path Planning Problem
par: Dang, Duc-Cuong, et autres
Publié: (2024)

Local Optima in Diversity Optimization: Non-trivial Offspring Population is Essential
par: Antipov, Denis, et autres
Publié: (2024)

Using 3-Objective Evolutionary Algorithms for the Dynamic Chance Constrained Knapsack Problem
par: Pathiranage, Ishara Hewa, et autres
Publié: (2024)

Runtime Analysis of Evolutionary Diversity Optimization on the Multi-objective (LeadingOnes, TrailingZeros) Problem
par: Antipov, Denis, et autres
Publié: (2024)

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

Bi-Objective Evolutionary Optimization for Large-Scale Open Pit Mine Scheduling Problem under Uncertainty with Chance Constraints
par: Pathiranage, Ishara Hewa, et autres
Publié: (2025)

On the Use of Evolutionary Optimization for the Dynamic Chance Constrained Open-Pit Mine Scheduling Problem
par: Pathiranage, Ishara Hewa, et autres
Publié: (2026)

Sliding Window Bi-Objective Evolutionary Algorithms for Optimizing Chance-Constrained Monotone Submodular Functions
par: Yan, Xiankun, et autres
Publié: (2024)

Optimizing Monotone Chance-Constrained Submodular Functions Using Evolutionary Multi-Objective Algorithms
par: Neumann, Aneta, et autres
Publié: (2020)

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

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

Analysis of Evolutionary Diversity Optimisation for the Maximum Matching Problem
par: Harder, Jonathan Gadea, et autres
Publié: (2024)

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

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

Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms
par: Pan, Shuaiqun, et autres
Publié: (2025)

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

Weighted-Scenario Optimisation for the Chance Constrained Travelling Thief Problem
par: Don, Thilina Pathirage, et autres
Publié: (2025)

Greedy Approaches for Packing While Travelling with Deterministic and Stochastic Constraints
par: Don, Thilina Pathirage, et autres
Publié: (2026)

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

Evolutionary Algorithm for Chance Constrained Quadratic Multiple Knapsack Problem
par: Perera, Kokila Kasuni, et autres
Publié: (2025)

On the Use of Bi-Objective Evolutionary Algorithms for the Stochastic MKP under Dynamic Constraints
par: Pathiranage, Ishara Hewa, et autres
Publié: (2026)

Multi-Objective Evolutionary Algorithms with Sliding Window Selection for the Dynamic Chance-Constrained Knapsack Problem
par: Perera, Kokila Kasuni, et autres
Publié: (2024)

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

Evolutionary Multi-Objective Diversity Optimization
par: Do, Anh Viet, et autres
Publié: (2024)

Quality Diversity Genetic Programming for Learning Scheduling Heuristics
par: Xu, Meng, et autres
Publié: (2025)

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

Trust Region-Based Bayesian Optimisation to Discover Diverse Solutions
par: Perera, Kokila Kasuni, et autres
Publié: (2025)

A Crowding Distance That Provably Solves the Difficulties of the NSGA-II in Many-Objective Optimization
par: Zheng, Weijie, et autres
Publié: (2024)

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

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

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

Runtime Analysis of Single- and Multi-Objective Evolutionary Algorithms for Chance Constrained Optimization Problems with Normally Distributed Random Variables
par: Neumann, Frank, et autres
Publié: (2021)

Evolving Reliable Differentiating Constraints for the Chance-constrained Maximum Coverage Problem
par: Ahouei, Saba Sadeghi, et autres
Publié: (2024)

Feature-based Evolutionary Diversity Optimization of Discriminating Instances for Chance-constrained Optimization Problems
par: Ahouei, Saba Sadeghi, et autres
Publié: (2025)

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

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

Evolutionary Algorithms for Generating Graphs Matching Desired Laplacian Spectra
par: Richter, Hendrik, et autres
Publié: (2026)

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

Analysis of Multitasking Pareto Optimization for Monotone Submodular Problems
par: Wigney, Liam, et autres
Publié: (2026)

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