Pith. sign in

REVIEW 6 cited by

Algorithm Evolution Using Large Language Model

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2311.15249 v1 pith:AA7CLQSU submitted 2023-11-26 cs.NE cs.AIcs.LG

Algorithm Evolution Using Large Language Model

classification cs.NE cs.AIcs.LG
keywords algorithmmodelalgorithmsdomainevolutionlanguagelargeoptimization
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Optimization can be found in many real-life applications. Designing an effective algorithm for a specific optimization problem typically requires a tedious amount of effort from human experts with domain knowledge and algorithm design skills. In this paper, we propose a novel approach called Algorithm Evolution using Large Language Model (AEL). It utilizes a large language model (LLM) to automatically generate optimization algorithms via an evolutionary framework. AEL does algorithm-level evolution without model training. Human effort and requirements for domain knowledge can be significantly reduced. We take constructive methods for the salesman traveling problem as a test example, we show that the constructive algorithm obtained by AEL outperforms simple hand-crafted and LLM-generated heuristics. Compared with other domain deep learning model-based algorithms, these methods exhibit excellent scalability across different problem sizes. AEL is also very different from previous attempts that utilize LLMs as search operators in algorithms.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 6 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Back to the Beginning of Heuristic Design: Bridging Code and Knowledge with LLMs

    cs.AI 2026-05 unverdicted novelty 7.0

    A knowledge-first approach to LLM-driven automatic heuristic design in combinatorial optimization yields better discovery efficiency, transfer, and generalization than code-centric baselines by formalizing a distortio...

  2. LLM-Enabled Automated Algorithm Design for Multiuser Fluid Antenna Communications

    cs.IT 2026-05 unverdicted novelty 6.0

    LLMs optimize genetic algorithm operations and create a new heuristic AutoPort for port selection and beamforming in fluid antenna systems to maximize min SINR, achieving near-optimal performance in simulations.

  3. PyVRP$^+$: LLM-Driven Metacognitive Heuristic Evolution for Hybrid Genetic Search in Vehicle Routing Problems

    cs.NE 2026-04 unverdicted novelty 5.0

    MEP uses LLMs in a structured reasoning cycle to evolve improved heuristics for HGS on VRPs, achieving up to 2.7% better solution quality and over 45% reduced runtime.

  4. Fine-tuning Large Language Model for Automated Algorithm Design

    cs.LG 2025-07 unverdicted novelty 5.0

    Fine-tuned LLMs with DAR sampling and DPO outperform off-the-shelf versions on algorithm design tasks and generalize to related settings.

  5. Vehicle Routing Problem Meets Large Language Models: An Overview and Perspectives

    math.OC 2026-07 unverdicted novelty 4.0

    Survey organizing LLM uses for VRP into modeler, designer, and coordinator roles, covering variants, solvers, benchmarks, and two experiments.

  6. Effective Harness Engineering for Algorithm Discovery with Coding Agents

    cs.SE 2026-05 unverdicted novelty 4.0

    Under fixed token budget on Circle Packing, deeper per-candidate reasoning beats generating more shallow candidates, and capable models produce evaluation hacks at higher rates.