Pith. sign in

REVIEW 2 cited by

Improving Existing Optimization Algorithms with LLMs

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 2502.08298 v1 pith:OIGEXHH2 submitted 2025-02-12 cs.AI cs.CLcs.LGcs.SE

Improving Existing Optimization Algorithms with LLMs

classification cs.AI cs.CLcs.LGcs.SE
keywords optimizationheuristicllmsalgorithmscmsaexistingabilityadapt
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

The integration of Large Language Models (LLMs) into optimization has created a powerful synergy, opening exciting research opportunities. This paper investigates how LLMs can enhance existing optimization algorithms. Using their pre-trained knowledge, we demonstrate their ability to propose innovative heuristic variations and implementation strategies. To evaluate this, we applied a non-trivial optimization algorithm, Construct, Merge, Solve and Adapt (CMSA) -- a hybrid metaheuristic for combinatorial optimization problems that incorporates a heuristic in the solution construction phase. Our results show that an alternative heuristic proposed by GPT-4o outperforms the expert-designed heuristic of CMSA, with the performance gap widening on larger and denser graphs. Project URL: https://imp-opt-algo-llms.surge.sh/

discussion (0)

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

Forward citations

Cited by 2 Pith papers

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

  1. LLM-Based Instance-Driven Heuristic Bias In the Context of a Biased Random Key Genetic Algorithm

    cs.NE 2025-09 conditional novelty 4.0

    An LLM-generated, per-instance bias vector improves a BRKGA on the NP-hard Longest Run Subsequence problem, with statistically significant gains on 15 of 35 instance groups, concentrated on complex instances.

  2. Large Language Models for Operations Research: A Comprehensive Survey

    math.OC 2026-05 unverdicted novelty 2.0

    A survey compiling roles, applications, benchmarks, challenges, and future directions for large language models in operations research.