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…

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.

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…

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.

The paper proposes a novel framework combining evolutionary algorithms and Secure Multi-Party Computation (MPC) to enable privacy-preserving distributed optimization that meets strict time deadlines.

The paper introduces a hybrid WGAN-GA framework that uses a Genetic Algorithm (GA) to refine graphs generated by a GAN, significantly reducing structural deviations and improving realism.

The paper proposes two novel multi-column RBFN architectures, MC-PSO and MC-APSO, that combine parallel RBFN structures with swarm optimization to significantly outperform existing methods in accuracy…

This paper enhances a genetic algorithm approach for solving the Shortest Vector Problem (SVP) in both integral and module lattices by incorporating domain-informed representation and crossover.

This paper enhances a genetic algorithm approach for solving the Shortest Vector Problem (SVP) in lattices by incorporating domain-informed representation, thereby extending its applicability to modul…

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

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.

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…

This paper demonstrates that optimizing hyperparameters for two specific recombination operators can significantly improve the performance of Cartesian Genetic Programming, which traditionally relies…

The paper proposes CoEvo-AHD, an LLM-driven co-evolutionary framework that co-evolves two coupled operator populations to design effective heuristics for combinatorial optimization problems with stron…

This paper introduces a method to automatically determine the optimal learning period ($ au$) for the Random Gradient hyper-heuristic, enabling it to optimally solve Pseudo-Boolean Problems without ma…

EvoGens is an evolution-inspired framework that treats scientific idea generation as an evolutionary search, significantly boosting the novelty and diversity of generated research ideas compared to ex…

The paper proposes BaSE, a multi-armed bandit approach, to optimally allocate a fixed budget of LLM calls across parallel evolutionary search trajectories, significantly improving mean fitness and rel…

MLEvolve is a novel self-evolving multi-agent framework that enables LLM agents to discover and optimize machine learning algorithms for complex, long-horizon tasks.

The paper addresses limitations in the Linear Ordering Problem (LOP) by introducing a novel benchmark suite derived from current economic data and an algorithmic scheme to generate diverse, high-quali…

The paper introduces MoCo-EA, an evolutionary attack method that replaces standard crossover with a continuous Bézier curve interpolation to efficiently exploit the connected manifold structure of adv…