Skip to content
Book Open access

LLM-Guided Discovery of Complementary Metaheuristic Operators with Adaptive Composition on the GNBG Benchmark

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.

Read PDF

Similar papers

Open access Aug 2026

Maned Wolf Optimizer: A Novel Nature-Inspired Metaheuristic Algorithm for Global Optimization and Feature Selection

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...

Israa Bashir Mohammed · 0 citations
Conference Sep 2026

Continuous Optimization through the Transition from Metaheuristic Search to Collaborative Orchestration

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 · 0 citations
Open access Sep 2026

Using Evolving Algorithms to Solve Bi-Criteria-Objective Function Machine Scheduling Problems

     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 · 0 citations
Open access 2026

Elite Population-Driven Backtracking Search Algorithm

: 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 · 0 citations
Preprint Sep 2026

A Metaheuristic Optimization Framework for Discrete Optimization under Strict Time Limits

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.