Image de couverture de livre

A Flexible Evolutionary Algorithm With Dynamic Mutation Rate Archive

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Krejca, Martin S., Witt, Carsten
Format:	Preprint
Publié:	2024
Sujets:	Neural and Evolutionary Computing
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Runtime Analysis of a Compact Genetic Algorithm on a Truly Multi-valued OneMax Function
par: Krejca, Martin S., et autres
Publié: (2026)

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

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)

Theoretical and Empirical Analysis of Lehmer Codes to Search Permutation Spaces with Evolutionary Algorithms
par: Ma, Yuxuan, et autres
Publié: (2025)

All Constant Mutation Rates for the $(1+1)$ Evolutionary Algorithm
par: Kelley, Andrew James
Publié: (2026)

All Mutation Rates $c/n$ for the $(1+1)$ Evolutionary Algorithm
par: Kelley, Andrew James
Publié: (2026)

Runtime Analysis of the Compact Genetic Algorithm on the LeadingOnes Benchmark
par: Chwiałkowski, Marcel, et autres
Publié: (2025)

A Runtime Analysis of the Multi-Valued Compact Genetic Algorithm on Generalized LeadingOnes
par: Adak, Sumit, et autres
Publié: (2025)

Estimation-of-Distribution Algorithms for Multi-Valued Decision Variables
par: Jedidia, Firas Ben, et autres
Publié: (2023)

Superior Genetic Algorithms for the Target Set Selection Problem Based on Power-Law Parameter Choices and Simple Greedy Heuristics
par: Doerr, Benjamin, et autres
Publié: (2024)

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

Runtime Analysis of a Multi-Valued Compact Genetic Algorithm on Generalized OneMax
par: Adak, Sumit, et autres
Publié: (2024)

Generalized Heavy-tailed Mutation for Evolutionary Algorithms
par: Eremeev, Anton V., et autres
Publié: (2026)

Improved Runtime Analysis of a Multi-Valued Compact Genetic Algorithm on Two Generalized OneMax Problems
par: Adak, Sumit, et autres
Publié: (2025)

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

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

Proven Runtime Guarantees for How the MOEA/D Computes the Pareto Front From the Subproblem Solutions
par: Doerr, Benjamin, et autres
Publié: (2024)

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

An Archive Can Bring Provable Speed-ups in Multi-Objective Evolutionary Algorithms
par: Bian, Chao, et autres
Publié: (2024)

Not Just for Archiving: Provable Benefits of Reusing the Archive in Evolutionary Multi-objective Optimization
par: Ren, Shengjie, et autres
Publié: (2025)

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

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

Effective Adaptive Mutation Rates for Program Synthesis
par: Ni, Andrew, et autres
Publié: (2024)

A Theoretical Perspective on Why Stochastic Population Update Needs an Archive in Evolutionary Multi-objective Optimization
par: Ren, Shengjie, et autres
Publié: (2025)

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

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)

Optimizing Hearthstone Agents using an Evolutionary Algorithm
par: García-Sánchez, Pablo, et autres
Publié: (2024)

An Efficient Evolutionary Algorithm for Few-for-Many Optimization
par: Shang, Ke, et autres
Publié: (2026)

Language Model Evolutionary Algorithms for Recommender Systems: Benchmarks and Algorithm Comparisons
par: Liu, Jiao, et autres
Publié: (2024)

Controlling the Mutation in Large Language Models for the Efficient Evolution of Algorithms
par: Yin, Haoran, et autres
Publié: (2024)

Self-Adjusting Evolutionary Algorithms Are Slow on Multimodal Landscapes
par: Lengler, Johannes, et autres
Publié: (2024)

GEEvo: Game Economy Generation and Balancing with Evolutionary Algorithms
par: Rupp, Florian, et autres
Publié: (2024)

Drift Analysis with Fitness Levels for Elitist Evolutionary Algorithms
par: He, Jun, et autres
Publié: (2023)

A Novel Dual-Stage Evolutionary Algorithm for Finding Robust Solutions
par: Du, Wei, et autres
Publié: (2024)

A Comparison-Relationship-Surrogate Evolutionary Algorithm for Multi-Objective Optimization
par: Pierce, Christopher M., et autres
Publié: (2025)

A Non-Dominated Sorting Evolutionary Algorithm Updating When Required
par: Farias, Lucas R. C., et autres
Publié: (2025)

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

Evolutionary Algorithms Are Significantly More Robust to Noise When They Ignore It
par: Antipov, Denis, et autres
Publié: (2024)

Evolutionary Algorithms for Optimizing Emergency Exit Placement in Indoor Environments
par: Cotta, Carlos, et autres
Publié: (2024)