Jul 2026· GECCO Companion· pp. 23-24· 0 citations· 7 references
Computer Science
TL;DR
This work establishes a pathway toward automated fine-grained optimisation of metaheuristic components in Hybrid Genetic Search and integrates LLMs within the ruin-and-re create framework of HGS.
Abstract
This paper presents an approach to automate the evolution of mutation operators in Hybrid Genetic Search (HGS) for the Capacitated Vehicle Routing Problem (CVRP) using Large Language Models (LLMs). Despite the advanced nature of HGS, its mutation heuristics are typically hand-crafted. Recent studies have demonstrated the capacity of LLMs to produce effective routing heuristics; however, these endeavours have predominantly overlooked the utilisation of mutation operators in favour of crossover operators. To bridge this gap, we integrate LLMs within the ruin-and-re create framework of HGS. This work establishes a pathway toward automated fine-grained optimisation of metaheuristic components.
Operational scheduling in transportation companies involves the efficient assignment of vehicles, drivers, routes, and schedules, a highly complex combinatorial optimization problem when capacity constraints, time windows, costs, emissions, and demand variability are considered. In this context, genetic algorithms (GA)...
Luis Enrique Rios Sepúlveda, Yanina Sanchez Calderon· Revista de Investigación en...· 0 citations
These findings confirm that the strategic integration of distance-based crossover, diversified mutation methods, and complete 2-opt local search effectively navigates the complex search space, enabling highly efficient route determination for large-scale TSPs.
Rujira Jullapak, A. Thammano· HighTech and Innovation Jour...· 0 citations
The Capacitated Vehicle Routing Problem (CVRP) remains a central concern in logistics research, as route optimisation under rigid capacity and fleet restrictions directly affects operational performance. Genetic Algorithms are widely used for this problem, yet their effectiveness depends heavily on the choice of soluti...
Although population-based metaheuristic algorithms have been widely applied to the One-Dimensional Cutting Stock Problem (1D-CSP), their performance is often limited by premature convergence and insufficient local search capability. This study presents a comparative investigation of the effect of local search on four p...
Gözde Alp, Fatih Soygazi, Yılmaz Kılıçaslan· Mathematics· 0 citations
The limits of the genetic algorithm in a multimodal model task that consists in the identification of a de Bruijn sequence of a given length between general binary sequences is demonstrated.
R. Knobloch, J. Mlýnek· European Conference on Model...· 0 citations
Meta-heuristics like genetic algorithms (GAs) effectively explore solution spaces but often yield suboptimal results and are sensitive to parameter tuning. In contrast, the mass-spring-damper layout optimization (MSDLO) method is fast and excels in locally optimizing resource arrangements, though its effectiveness depe...
Ramez Awad, Joshua J. Beck· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.