Bridging Large Language Models and Optimization: A Unified Framework for Text-attributed Combinatorial Optimization
About
To advance capabilities of large language models (LLMs) in solving combinatorial optimization problems (COPs), this paper presents the Language-based Neural COP Solver (LNCS), a novel framework that is unified for the end-to-end resolution of diverse text-attributed COPs. LNCS leverages LLMs to encode problem instances into a unified semantic space, and integrates their embeddings with a Transformer-based solution generator to produce high-quality solutions. By training the solution generator with conflict-free multi-task reinforcement learning, LNCS effectively enhances LLM performance in tackling COPs of varying types and sizes, achieving state-of-the-art results across diverse problems. Extensive experiments validate the effectiveness and generalizability of the LNCS, highlighting its potential as a unified and practical framework for real-world COP applications.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Capacitated Vehicle Routing Problem | CVRP N=100 | Objective Value16.35 | 73 | |
| Traveling Salesman Problem | TSP N=20 | Optimality Gap0.55 | 33 | |
| Traveling Salesman Problem | TSP N=100 | Cost (%)4.38 | 29 | |
| Capacitated Vehicle Routing Problem | CVRP 20 | Optimality Gap (%)2.51 | 27 | |
| Traveling Salesperson Problem | Synthetic COP instances | Optimality Gap0.39 | 20 | |
| Capacitated Vehicle Routing Problem | CVRP N=50 | Objective Value10.74 | 17 | |
| Capacitated Vehicle Routing Problem | Synthetic COP instances | Optimality Gap2.54 | 14 | |
| Knapsack Problem | Synthetic COP instances | Optimality Gap0.04 | 14 | |
| Knapsack Problem | KP n=50 | Objective Value20.071 | 7 | |
| Knapsack Problem | KP n=100 | Objective Value40.361 | 7 |