Jul 2026· Proceedings of the Genetic and Evolutionary Computation Conference Companion· 1 citation· 14 references
Computer Science
Abstract
Large Language Models (LLMs) are opening new directions for automated heuristic design (AHD), allowing evolutionary methods to create and enhance heuristics for constrained optimization problems (COPs). However, most existing approaches face the challenge of the exploration-exploitation balance, where the evolution needs to escape convergence to homogeneous populations and discover as large a heuristic landscape as possible. To address this challenge, we introduce Quality-Diversity Evolution (QDEvo), a multi-objective framework that integrates Quality-Diversity optimization with LLM-based AHD. At its core, QDEvo employs a semantic survival selection mechanism that clusters algorithms by functional similarity, then applies local Pareto competition. Evaluation on well-known COPs benchmarks and real-world problems shows that our method consistently outperforms the state-of-the-art baseline in both Hypervolume and Inverted Generational Distance metrics. These results facilitate further exploration of the algorithmic design space, while ensuring competitive solution quality and efficiency.
This work proposes a general LES framework that incorporates feature-assisted niche construction within abstract search spaces, enabling the seamless integration of niche-based search strategies from evolutionary computation and introduces PartEvo (Partition to Evolve), an LES method that combines niche collaborative search and advanced prompting strategies to improve algorithm discovery efficiency.
Qinglong Hu, Qingfu Zhang· Neural Information Processin...· 10 citations· ⚡3
This work proposes a framework for designing both single- and multi-objective benchmark problems with identifiable local optima and controllable landscape features and implies that the landscape features of single-objective MSG landscapes are inherited in multi-objective extensions.
Shu Tanaka, Shoichiro Tanaka, Kippei Mizuta et al.· Annual Conference on Genetic...· 1 citation
Generative heuristics is introduced, a methodology that combines traditional metaheuristics with LLM-based semantic evaluation to address ‘soft optimization’ problems containing both hard quantitative constraints and soft qualitative objectives.
Miguel Saiz, A. Juan, J. Panadero· Mathematics· 0 citations
This work investigates the hybridization of a Genetic Algorithm with Pareto Local Search to improve the exploration of non-dominated rulesets and provides a documented baseline for hybrid metaheuristics in rule mining.
Evgueni Blanquart, L. Jourdan, Nadarajen Veerapen· Proceedings of the Genetic a...· 0 citations
LLM-driven evolutionary search can discover algorithm designs that achieve Pareto-efficient trade-offs difficult to reach through manual design, with SMAC hyperparameter optimization integrated into the evolutionary loop.
G. Laskaris, R. Brasher, Niki van Stein et al.· 0 citations
This study systematically investigates multiple elitism mechanisms for NT within tree-based MO Genetic Programming (MOGP), including NSGA-II population replacement, crowding distance, first-objective, and a novel ideal-point strategy, comparing them against non-elitist NT and standard NSGA-II.
Filipa Vieira Goncalves Pereira, Karina Brotto Rebuli, M. Giacobini et al.· Proceedings of the Genetic a...· 0 citations