REVIEW 7 cited by
OR-LLM-Agent: Automating Modeling and Solving of Operations Research Optimization Problems with Reasoning LLM
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
Signed reviews
read the original abstract
With the rise of artificial intelligence (AI), applying large language models (LLMs) to mathematical problem-solving has attracted increasing attention. Most existing approaches attempt to improve Operations Research (OR) optimization problem-solving through prompt engineering or fine-tuning strategies for LLMs. However, these methods are fundamentally constrained by the limited capabilities of non-reasoning LLMs. To overcome these limitations, we propose OR-LLM-Agent, an AI agent framework built on reasoning LLMs for automated OR problem solving. The framework decomposes the task into three sequential stages: mathematical modeling, code generation, and debugging. Each task is handled by a dedicated sub-agent, which enables more targeted reasoning. We also construct BWOR, an OR dataset for evaluating LLM performance on OR tasks. Our analysis shows that in the benchmarks NL4OPT, MAMO, and IndustryOR, reasoning LLMs sometimes underperform their non-reasoning counterparts within the same model family. In contrast, BWOR provides a more consistent and discriminative assessment of model capabilities. Experimental results demonstrate that OR-LLM-Agent utilizing DeepSeek-R1 in its framework outperforms advanced methods, including GPT-o3, Gemini 2.5 Pro, DeepSeek-R1, and ORLM, by at least 7\% in accuracy. These results demonstrate the effectiveness of task decomposition for OR problem solving.
Forward citations
Cited by 7 Pith papers
-
YUKTI: From Natural-Language Situations to Robust, Verifiable Decisions An Uncertainty-Typed Proposition IR, Assumption-Robust Pareto Frontiers, and a Regret Certificate
An uncertainty-typed proposition IR plus Assumption-Robust Pareto Frontiers (ARPF) with a regret certificate cuts held-out regret by >90% under misspecification and beats status-quo and naive rules on real marketing data.
-
NEMO: Execution-Aware Optimization Modeling via Autonomous Coding Agents
An execution-aware agent pipeline achieves state-of-the-art or tied-top accuracy on eight of nine optimization benchmarks.
-
Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem
LLM-guided evolutionary search, aided by scaffolding and self-correction, discovered a 3D packing scoring function competitive with human heuristics, but the model invented no new algorithm structures and its results ...
-
Optimization and Constraint Modeling using LLMs with a Retrieval Augmented Generation Process
A RAG pipeline with 500 synthetic problem-solution pairs is claimed to improve LLM optimization modeling accuracy, but the evaluation compares different error tolerances between conditions.
-
Know the Ropes: A Heuristic Strategy for LLM-based Multi-Agent System Design
A heuristic framework that decomposes known algorithms into typed LLM-agent subtasks lifts small-model accuracy on knapsack and assignment problems from near-zero to high levels after fixing one bottleneck agent.
-
RideAgent: An LLM-Enhanced Optimization Framework for Automated Taxi Fleet Operations
An LLM-powered framework that turns natural language fleet objectives into optimization goals and uses LLM-guided variable fixing to accelerate electric taxi pre-allocation and pricing MIPs by roughly half.
-
Evaluation of LLMs for mathematical problem solving
A three-model, three-dataset LLM math evaluation using a multi-dimensional reasoning rubric, undermined by contradictory accuracy tables.
Discussion (0). Continue with ORCID to comment.