Genetic Algorithm
Genetic algorithms (GAs) are optimization techniques inspired by natural selection, aiming to find optimal or near-optimal solutions for complex problems by iteratively improving a population of candidate solutions. Current research emphasizes enhancing GA efficiency and applicability, focusing on novel selection strategies (e.g., upper bound-based selection), hybrid approaches integrating GAs with deep kernel learning or neural networks, and addressing challenges in high-dimensional spaces and specific problem domains (e.g., the traveling salesman problem, feature selection). These advancements are impacting diverse fields, including drug discovery, wildfire management, and resource allocation, by providing robust and flexible optimization tools for computationally challenging problems.
Papers
A Flexible Job Shop Scheduling Problem Involving Reconfigurable Machine Tools Under Industry 5.0
Hessam Bakhshi-Khaniki, Reza Tavakkoli-Moghaddam, Zdenek Hanzalek, Behdin Vahedi-Nouri
A Lattice-based Method for Optimization in Continuous Spaces with Genetic Algorithms
Cameron D. Harris, Kevin B. Schroeder, Jonathan Black
Rethinking Selection in Generational Genetic Algorithms to Solve Combinatorial Optimization Problems: An Upper Bound-based Parent Selection Strategy for Recombination
Prashant Sankaran, Katie McConky
Rapid optimization in high dimensional space by deep kernel learning augmented genetic algorithms
Mani Valleti, Aditya Raghavan, Sergei V. Kalinin