Share your thoughts, 1 month free Claude Pro on usSee more
WorkDL logo mark

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.

Xia Jiang, Yaoxin Wu, Yuan Wang, Yingqian Zhang• 2024

Related benchmarks

TaskDatasetResultRank
Capacitated Vehicle Routing ProblemCVRP N=100
Objective Value16.35
73
Traveling Salesman ProblemTSP N=20
Optimality Gap0.55
33
Traveling Salesman ProblemTSP N=100
Cost (%)4.38
29
Capacitated Vehicle Routing ProblemCVRP 20
Optimality Gap (%)2.51
27
Traveling Salesperson ProblemSynthetic COP instances
Optimality Gap0.39
20
Capacitated Vehicle Routing ProblemCVRP N=50
Objective Value10.74
17
Capacitated Vehicle Routing ProblemSynthetic COP instances
Optimality Gap2.54
14
Knapsack ProblemSynthetic COP instances
Optimality Gap0.04
14
Knapsack ProblemKP n=50
Objective Value20.071
7
Knapsack ProblemKP n=100
Objective Value40.361
7
Showing 10 of 17 rows

Other info

Follow for update