Pith. sign in

REVIEW 3 cited by

Leveraging Large Language Models to Develop Heuristics for Emerging Optimization Problems

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 2503.03350 v1 pith:4BUBZBUX submitted 2025-03-05 cs.AI

classification cs.AI
keywords heuristicsmodelsoptimizationproblemsceohgenerateheuristicllms
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Combinatorial optimization problems often rely on heuristic algorithms to generate efficient solutions. However, the manual design of heuristics is resource-intensive and constrained by the designer's expertise. Recent advances in artificial intelligence, particularly large language models (LLMs), have demonstrated the potential to automate heuristic generation through evolutionary frameworks. Recent works focus only on well-known combinatorial optimization problems like the traveling salesman problem and online bin packing problem when designing constructive heuristics. This study investigates whether LLMs can effectively generate heuristics for niche, not yet broadly researched optimization problems, using the unit-load pre-marshalling problem as an example case. We propose the Contextual Evolution of Heuristics (CEoH) framework, an extension of the Evolution of Heuristics (EoH) framework, which incorporates problem-specific descriptions to enhance in-context learning during heuristic generation. Through computational experiments, we evaluate CEoH and EoH and compare the results. Results indicate that CEoH enables smaller LLMs to generate high-quality heuristics more consistently and even outperform larger models. Larger models demonstrate robust performance with or without contextualized prompts. The generated heuristics exhibit scalability to diverse instance configurations.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

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

  2. Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems

    cs.AI 2025-05 conditional novelty 5.0 of 10

    LLM-generated search heuristics run through the CPro1 protocol with the reasoning model o3-mini-high produced verified constructions resolving open instances in 7 Handbook design families and newer problems.

  3. Joint User Association and Beamforming Design for ISAC Networks with Large Language Models

    cs.IT 2025-06 conditional novelty 4.0 of 10

    A GPT-o1-driven user association step combined with convex beamforming achieves near-optimal sum rate in a small multi-base-station ISAC network.

Pith tools