ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Evolutionary algorithms”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.NETheoreticalRecentJun 16, 2026

Evolutionary Algorithms and Multi-Objective Minimum Spanning Trees with Limited Distinct Weight Values

Narges Tavassoli Kejani, Andrew M. Sutton, Frank Neumann

This paper provides new runtime results and experimental investigations for evolutionary multi-objective algorithms on the multi-objective minimum spanning tree problem.

View →
cs.NEcs.AIRecentMay 27, 2026

Performance and Explainability Requirements of Evolutionary Algorithms in Real-World Physics-Informed Optimization

Helena Stegherr, Michael Heider, Nils Meyer, Tobias Thummerer +6 more

This paper analyzes the performance and explainability requirements of evolutionary algorithms when applied to complex, real-world physics-informed optimization problems, identifying a gap between cur…

View →
cs.NEcs.AIcs.LGTheoreticalRecentJun 26, 2026

Analysis of Parameter Settings for the Bat Algorithm Using Variance Evolution

Xin-She Yang, Mehmet Karamanoglu

This paper provides theoretical analysis of parameter settings for the bat algorithm using dynamical systems and population variance theory, and validates the results through numerical experiments.

View →
cs.NEcs.AIcs.DSRecentMay 27, 2026

A Fresh Look at Lamarckian Evolution and the Baldwin Effect

Inès Benito, Johannes F. Lutzeyer, Benjamin Doerr

The paper empirically and theoretically demonstrates that incorporating Lamarckian and Baldwinian mechanisms into evolutionary algorithms significantly outperforms standard Darwinian evolution, especi…

View →
cs.NEcs.AIEmpiricalRecentJun 10, 2026

SPEA2$^+$: Improved Density Estimation in SPEA2 with Provable Runtime Guarantees

Duc-Cuong Dang, Andre Opris, Dirk Sudholt

The paper conducts a runtime analysis of the Strength Pareto Evolutionary Algorithm 2 (SPEA2) and proposes an improved variant, SPEA2$^+$, to address its limitations in handling dominated solutions.

View →
cs.NETheoreticalRecentJul 15, 2026

Asymptotical Analysis of the $(1+(λ,λ))$ GA Escape Time from Local Optima on Jump Functions

Anton V. Eremeev, Valentin A. Topchii

This paper analyzes the runtime of a genetic algorithm on Jump$_k$ benchmark functions using limit theorems from probability theory, providing a tighter upper bound on escape time than previous work.

View →
cs.NEEmpiricalRecentJul 18, 2026

Hybrid Augmented Lagrangian Method for General Constrained Optimization via Evolutionary Algorithms

Lampros Printzios, Konstantinos Chatzilygeroudis

This paper proposes a Hybrid Augmented Lagrangian (HyAL) method that integrates the constraint-handling strengths of the AL framework with the exploratory power of population-based search.

View →
cs.NEEmpiricalRecentJun 18, 2026

Weight Adaptation for Improving Parallel Performance of Adaptive Stochastic Natural Gradient

Yutaro Yamada, Kento Uchida, Shinichi Shirakawa

The paper proposes Weight Adaptation ASNG, a probabilistic model-based evolutionary algorithm that adapts its weight parameters to improve optimization efficiency and robustness.

View →
cs.LGcs.AIcs.LORecentMay 29, 2026

Learning to Solve and Optimize by Evolving Code

Veronika Semmelrock, Benedetta Strizzolo, Francesco Zuccato, Gerhard Friedrich +2 more

The paper introduces CHECKMATE, a novel framework that uses code evolution to automatically generate and optimize algorithms for complex combinatorial problems, outperforming state-of-the-art solvers.

View →
cs.NEcs.AIcs.LGEmpiricalRecentJun 10, 2026

Mathematical perspective on genetic algorithms with optimization guided operators

Anna Brandenberger, Ilan Doron-Arad, Elchanan Mossel

This paper introduces a general model of genetic algorithms and studies their optimization problems using reinforcement learning.

View →
cs.NEEmpiricalRecentJun 19, 2026

On the Use of Survival Selection Methods for Evolutionary Diversity Optimisation

Adel Nikfarjam, Jakob Bossek, Aneta Neumann, Frank Neumann

This paper investigates the benefits of generating multiple solutions in each generation for Evolutionary Diversity Optimisation (EDO) and proposes efficient methods to achieve it.

View →
cs.NEcs.AIcs.LGTheoreticalRecentJun 14, 2026

Runtime Analysis of Cartesian Genetic Programming in Evolving Boolean Functions

Duc-Cuong Dang, Roman Kalkreuth, Andre Opris

The paper provides a runtime analysis of Cartesian Genetic Programming (CGP) for evolving Boolean functions and proves asymptotic bounds for the expected number of fitness evaluations.

View →
cs.NETheoreticalRecentJun 11, 2026

Runtime Analysis of the $(μ+ 1)$-ES in a Homogenous Progress Model

Johannes Lengler, Raghu Raman Ravi

The authors introduce a new model to study the fitness progress of Evolution Strategies (ES) in generic problems and rigorously analyze the expected growth rate of the continuous steady-state (μ+1)-ES…

View →
cs.NEcs.LGEmpiricalRecentJun 30, 2026

Evaluation of Population Initialization Methods for Genetic Programming-based Symbolic Regression

Lukas Kammerer, Gabriel Kronberger, Deaglan J. Bartlett, Harry Desmond +2 more

This paper compares the effect of different initialization methods on the accuracy and complexity of solutions in genetic programming for symbolic regression, finding no significant differences.

View →
cs.AIcs.SERecentJun 1, 2026

Algorithmic algorithm development with LLMs: A Case Study on LLM-Usage for Contraction Order Optimization in Tensor Networks

Fabian Hoppe, Melven Röhrig-Zöllner, Philipp Knechtges

The paper demonstrates the potential of using LLMs within verifier-guided evolutionary coding agents to develop and improve algorithms, specifically applied to contraction order optimization in tensor…

View →
cs.AIRecentMay 28, 2026

LLM-Evolved Domain-Independent Heuristics for Symbolic AI Planning

Elliot Gestrin, Jendrik Seipp

This paper introduces the first LLM-generated, domain-independent heuristics for symbolic AI planning, using evolutionary search to surpass the performance of hand-engineered state-of-the-art methods.

View →
cs.NEEmpiricalRecentJul 25, 2026

A genetic algorithm for student academic resource allocation

Ana F. Hernández, Andrej Franulic, Fernando Jiménez

This paper proposes a Genetic Algorithm with constraint repair mechanism for optimally allocating educational resources to high school mathematics students under study time constraints.

View →
cs.NEcs.CRApr 19, 2026

Monotone but Exciting: On Evolving Monotone Boolean Functions with High Nonlinearity

Claude Carlet, Marko Čupić, Marko Ðurasevic, Domagoj Jakobovic +2 more

The paper investigates the ability of evolutionary computation to discover monotone Boolean functions with high nonlinearity, demonstrating that genetic programming is a highly effective encoding for…

View →