20 results for “Evolutionary algorithms”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper provides new runtime results and experimental investigations for evolutionary multi-objective algorithms on the multi-objective minimum spanning tree problem.
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…
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.
The paper empirically and theoretically demonstrates that incorporating Lamarckian and Baldwinian mechanisms into evolutionary algorithms significantly outperforms standard Darwinian evolution, especi…
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.
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.
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.
The paper proposes Weight Adaptation ASNG, a probabilistic model-based evolutionary algorithm that adapts its weight parameters to improve optimization efficiency and robustness.
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.
This paper introduces a general model of genetic algorithms and studies their optimization problems using reinforcement learning.
This paper investigates the benefits of generating multiple solutions in each generation for Evolutionary Diversity Optimisation (EDO) and proposes efficient methods to achieve it.
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.
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…
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.
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…
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.
This paper proposes a Genetic Algorithm with constraint repair mechanism for optimally allocating educational resources to high school mathematics students under study time constraints.
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…