Jul 2026· GECCO Companion· pp. 11-12· 0 citations· 8 references
Computer Science
TL;DR
The method begins with generation of candidate algorithms, followed by LLM-guided selection of impactful operators, iterative construction of specialized operator variants, and final synthesis of an adaptive optimizer.
Abstract
We propose a framework for automated discovery and composition of metaheuristic operators using large language models (LLMs). The method begins with generation of candidate algorithms, followed by LLM-guided selection of impactful operators, iterative construction of specialized operator variants, and final synthesis of an adaptive optimizer. The approach emphasizes task coverage rather than single-metric optimization, producing complementary operators specialized for different problem characteristics. These operators are subsequently integrated into an adaptive algorithm via LLM-driven parameter control and selection mechanisms. This work is submitted as a competition entry for LLM-generated metaheuristics evaluated on the GNBG benchmark.
The increasing complexity of real-world optimization problems requires efficient and robust metaheuristic optimization algorithms. In this paper, a novel nature-inspired algorithm, called the Maned Wolf Optimizer (MWO), is proposed. The proposed algorithm is inspired by the hunting strategies and solitary behavior of m...
Continuous optimization research is moving beyond standalone metaheuristic design toward landscape analysis, algorithm selection, cooperative search, and adaptive control. This paper synthesizes these developments through a mechanism-centered taxonomy with four layers: problem characterization, algorithm intelligence,...
Daniel Riano Kaparang, H. Purnomo, Richard G. Mayopu· 2026 3rd International Confe...· 0 citations
This work proposes a general method to reduce the number of scenario evaluations per solution and thus improve metaheuristiciency, using a sequential sampling procedure exploiting estimates of the solutions’ expected objective values.
Noah Schutte, K. Postek, Neil Yorke-Smith· 0 citations
This research examines the suitability of two new local search-based metaheuristics (i.e., Simulated Annealing (SA) and Particle Swarm Optimisation (PSO)) for addressing single-machine scheduling problems in terms of two complementary objective functions: and . We also analyze the interaction of the two objective...
Iraq T. Abbas, R. J. Mitlif· Iraqi Journal of Science· 0 citations
: Backtracking search algorithm (BSA) is a very simple and efficient metaheuristic algorithm. However, BSA only relies on the random crossover vectors generated between the historical population and the current population to guide the search direction of the population, lacking purposefulness. In view of this, this pap...
Yi-Ying Zhang· Computers, Materials & C...· 0 citations
STILO is introduced, a MOF specifically designed for optimization under strict time limits that integrates fine-grained configuration spaces for ant colony optimization, genetic algorithm, and simulated annealing, combining existing and novel operators.
Umut Çalıkyılmaz, Nitin Nayak, S. Groppe· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.