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.
Abstract
In many real-world domains, optimization problems involve both quantitative objectives and qualitative criteria that cannot be directly formulated as mathematical functions. While recent research has integrated large language models (LLMs) into optimization algorithms, these approaches primarily use LLMs to guide the search process, generate heuristics, or tune optimization strategies, rather than to evaluate semantic objectives. This paper introduces generative heuristics, 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. The proposed methodology first applies a metaheuristic algorithm to generate a shortlist of high-quality candidate solutions satisfying the quantitative objectives. These candidates are then evaluated by an LLM according to a user-defined qualitative rubric, and the resulting semantic scores are incorporated into the optimization process through a weighted soft objective. The methodology is illustrated through a constrained portfolio optimization problem in which financial risk is minimized while simultaneously promoting strategic objectives related to sector diversification, geographic exposure, environmental-social-governance quality, and overall portfolio coherence. Experimental results show that the proposed methodology consistently improves strategic alignment while producing solutions that remain close to those obtained from the hard optimization formulation.
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.
Nam Do Khanh, Nhat Nguyen Tran Minh, Dat Pham Vu Tuan et al.· Proceedings of the Genetic a...· 1 citation
A systematic mapping study of multi-objective optimization algorithms, tracing their evolution from classical Pareto-based methods toward AI-driven and hybrid approaches, with software testing as the primary application domain, and outlining a research roadmap for the next generation of multi-objective optimization systems that combine the complementary mathematical strengths of neural function approximation and evolutionary diversity preservation.
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
This study introduces a novel constrained multi-objective evolutionary algorithm, termed DPCME, which employs two interacting populations that exchange information, enabling effective global exploration and reducing the risk of convergence to local optima.
This paper compares six different strategies identified in a recent survey, categorizing them as either global strategies (GS), which treat the decision vector as a unified type, or decomposition-based strategies (DS), which split the problem into continuous and discrete subproblems.
Thomas Lang, Denis Pallez· Proceedings of the Genetic a...· 0 citations
Results show that integrating local search significantly enhances performance, while a principled method for setting hybrid parameters ensures robustness and reproducibility, highlighting the potential of combining mathematical programming techniques with evolutionary algorithms for high-dimensional many-objective optimization problems.
Regina C. L. C. de Sousa, Dênis E. C. Vargas, Elizabeth F. Wanner et al.· Journal of Heuristics· 0 citations