Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.31649

From Hand-Crafted to LLM-Based Variation Operators in Metaheuristics: A Tutorial

Camilo Chacón Sartori·Guillem Rodríguez-Corominas·Christian Blum
View original source ↗Read source document ↗Export metadata ↓

Abstract

Large language models (LLMs) are increasingly being employed as variation operators in metaheuristics, generating or modifying candidate solutions, heuristics, or programs inside iterative search loops. This shift reframes variation as a model call conditioned on different types of information. We introduce an operator-level framework with two descriptors: (1) the type of prompt-conditioning information at variation time (\texttt{Numeric}, \texttt{Symbolic}, \texttt{Linguistic}), and (2) artifact persistence, identifying what survives the model call (\texttt{Transient}, \texttt{Amortized}, \texttt{Transfer}). The tutorial shows how to classify, build, and select these operators through a worked build template, a method survey, an evidence table, and a cost-aware decision guide.

Explore related subjects

cs.NEcs.AIcs.CL

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Camilo Chacón Sartori, Guillem Rodríguez-Corominas, Christian Blum. 2026-09-13. From Hand-Crafted to LLM-Based Variation Operators in Metaheuristics: A Tutorial. https://arxiv.org/abs/2609.31649

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Where Polanyi Meets Galois: Tacit Knowing as an Algebro-Deterministic Operation, Toward Re-rooting AI-Generated Science

We argue that tacit knowing is better modelled as an operating regime of a memory than as a kind of content. Our substrate is VaCoAl, an algebro-deterministic XOR-and-shift hyperdimensional memory over GF(2), realized as CASRAM and PyVaCoAl. In it, a DAG reads two ways. Repairing every collision (Rescue) makes the trace exactly auditable but ranks no path higher; tolerating them (Don't Care) yields a path confidence, CR$_2$, silently favouring direct routes. This audit-valuation complementarity formalizes Polanyi's claim that tacit and explicit are not sharply divided. It separates contingent tacitness, which a new query brings out (AlphaGo's game tree), from regime-bound tacitness, statable only once it is gone (AlphaGo's hunches). (1) Polanyi's from-to structure reads as non-commutative binding. (2) Explicating the valuation destroys it, as with Polanyi's pianist, yet a closed-form law states it. Polanyi, Nonaka, Tsoukas and Collins each capture part of this, narrowly; even Nonaka and von Krogh's continuum cannot tell the classes apart. (3) Collins's three tacit knowledges become strata, one outside the substrate. (4) Our mentor-student DAG is a tacit-transmission graph. (5) Tao's remark that AI-solved problems spawn few follow-ups reveals rootless explicit knowledge: checkable results no one can trace or yet understands. To re-root them, LLMs generate, VaCoAl/PyVaCoAl keeps an auditable trace with its confidence, and people value, a role virtue epistemology shows cannot be offloaded. Art, craft and skill show the same decoupling of form from the maker's becoming. (6) On Mercier and Sperber's account an LLM is reason's arguing side set loose, a sophist; truth-seeking lies deeper, in Polanyi's conviviality, which we conjecture is the root of evolvability and, as the Buddhist idea that plants and lands attain buddhahood suggests, reaches beyond humans. Testable predictions follow.

cs.NE↗
arXiv2026

AgenticEvolve: Evolutionary Program Search with Persistent Language Model Agents that Design and Run Experiments

Evolutionary program search with large language models keeps the structure of an evolutionary algorithm and uses the model as its variation operator. Typically, the model generates each candidate program in a single request from parent programs and their scores. We present AgenticEvolve, an evolutionary program search framework in which each island is run by a persistent large language model agent. Between evaluations, the agent designs and runs experiments on the candidate program. To measure the contribution of experimentation, we compare AgenticEvolve with No-analysis, an otherwise identical configuration with experiments disabled. On two heuristic design tasks with three large language models, AgenticEvolve produces better programs than No-analysis and OpenEvolve on both hidden and unseen instances. It reaches the baselines' final quality with far fewer evaluations and comparable cost. On twelve equation discovery problems, it recovers the ground-truth structure of more equations than No-analysis and existing language-model and genetic programming baselines.

cs.NE↗
arXiv2026

First hardware demonstration of a continuous-state probabilistic computer with programmable energy-defined sampling

Probabilistic computing has proved useful for combinatorial optimization, but conventional implementations rely on binary stochastic units and sigmoid-based updates. Extending these systems to continuous variables requires binary encoding. Here we introduce a continuous probabilistic computer (CPC) whose continuous probabilistic bits sample bounded states from conditional distributions defined by local energies. Separating random-source generation from conditional sampling provides a route to using physical random sources with different native distributions. A field-programmable gate array (FPGA) prototype updates finite-precision states using digital randomness. The same framework supports product constraints, memory recovery and solution-space exploration. For the tested 7-bit factorization case, fixed-temperature FPGA CPC reduces mean core solving time approximately 33,000-fold relative to the evaluated quadratic unconstrained binary optimization software implementation. The FPGA recovers stored MNIST patterns without pretrained networks, achieving final success rates of 100%. Software CPC reaches 90% reference coverage of the feasible area in approximately 18% of the time required by restarted Adam.

cs.NE↗