Pith. sign in

REVIEW 5 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

classification cs.NEcs.AIcs.LG
keywords algorithmmodelalgorithmsdomainevolutionlanguagelargeoptimization
verification ladder T0 review T1 audit T2 compute T3 formal
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). Continue with ORCID to comment.

Forward citations

Cited by 5 Pith papers

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

  1. PathWise: Planning through World Model for Automated Heuristic Design via Self-Evolving LLMs

    cs.AI 2026-01 conditional novelty 6.0 of 10

    PathWise generates better optimization heuristics with fewer evaluations by planning over a graph memory of past derivations using multiple LLM agents.

  2. EALG: Evolutionary Adversarial Generation of Language Model-Guided Generators for Combinatorial Optimization

    cs.AI 2025-06 reject novelty 6.0 of 10

    EALG uses LLMs in an evolutionary adversarial loop to generate increasingly hard TSP instances and heuristics that beat existing LLM-designed solvers on those instances and on TSPLIB.

  3. LLaMEA-BO: A Large Language Model Evolutionary Algorithm for Automatically Generating Bayesian Optimization Algorithms

    cs.LG 2025-05 conditional novelty 6.0 of 10

    An LLM-based evolutionary framework, LLaMEA-BO, automatically writes complete Bayesian optimization algorithms that outperform several state-of-the-art baselines on BBOB and Bayesmark.

  4. REMoH: A Reflective Evolution of Multi-objective Heuristics approach via Large Language Models

    cs.AI 2025-06 reject novelty 5.0 of 10

    REMoH evolves LLM-written heuristics with NSGA-II and a reflection mechanism, reporting competitive FJSSP results that are weakened by test-set selection.

  5. A Systematic Survey on Large Language Models for Evolutionary Optimization: From Modeling to Solving

    cs.NE 2025-09 conditional novelty 4.0 of 10

    A literature survey that classifies LLM-based optimization research into modeling and solving, with solving divided into LLMs as optimizers, low-level components, and high-level managers.

Pith tools