Evolutionary Algorithm
Evolutionary algorithms (EAs) are computational optimization methods inspired by natural selection, aiming to find optimal or near-optimal solutions to complex problems by iteratively improving a population of candidate solutions. Current research emphasizes hybrid approaches, integrating EAs with other techniques like large language models (LLMs) for automated hyperparameter tuning and prompt engineering, reinforcement learning for robot design, and even quantum computing for enhanced search capabilities. These advancements are improving the efficiency and applicability of EAs across diverse fields, from logistics and manufacturing to drug discovery and materials science, by tackling previously intractable optimization challenges.
Papers
Analysis of Evolutionary Diversity Optimisation for the Maximum Matching Problem
Jonathan Gadea Harder, Aneta Neumann, Frank Neumann
Runtime Analysis of Evolutionary Diversity Optimization on the Multi-objective (LeadingOnes, TrailingZeros) Problem
Denis Antipov, Aneta Neumann, Frank Neumann, Andrew M. Sutton
Runtime Analysis of a Multi-Valued Compact Genetic Algorithm on Generalized OneMax
Sumit Adak, Carsten Witt