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

Aligning LLMs with Graph Neural Solvers for Combinatorial Optimization

About

Recent research has demonstrated the effectiveness of large language models (LLMs) in solving combinatorial optimization problems (COPs) by representing tasks and instances in natural language. However, purely language-based approaches struggle to accurately capture complex relational structures inherent in many COPs, rendering them less effective at addressing medium-sized or larger instances. To address these limitations, we propose AlignOPT, a novel approach that aligns LLMs with graph neural solvers to learn a more generalizable neural COP heuristic. Specifically, AlignOPT leverages the semantic understanding capabilities of LLMs to encode textual descriptions of COPs and their instances, while concurrently exploiting graph neural solvers to explicitly model the underlying graph structures of COP instances. Our approach facilitates a robust integration and alignment between linguistic semantics and structural representations, enabling more accurate and scalable COP solutions. Experimental results demonstrate that AlignOPT achieves state-of-the-art results across diverse COPs, underscoring its effectiveness in aligning semantic and structural representations. In particular, AlignOPT demonstrates strong generalization, effectively extending to previously unseen COP instances.

Shaodi Feng, Zhuoyi Lin, Yaoxin Wu, Haiyan Yin, Yan Jin, Senthilnath Jayavelu, Xun Xu• 2026

Related benchmarks

TaskDatasetResultRank
Traveling Salesman ProblemTSPLib Large-scale instances
Objective Value7.55e+4
120
Capacitated Vehicle Routing ProblemCVRP N=100
Objective Value16.17
73
Traveling Salesman ProblemTSP N=20
Optimality Gap0.00e+0
33
Traveling Salesman ProblemTSP N=100
Cost (%)0.38
29
Capacitated Vehicle Routing ProblemCVRP 20
Optimality Gap (%)0.49
27
Traveling Salesperson ProblemSynthetic COP instances
Optimality Gap0.00e+0
20
Capacitated Vehicle Routing ProblemCVRP N=50
Objective Value10.68
17
Capacitated Vehicle Routing ProblemSynthetic COP instances
Optimality Gap0.49
14
Knapsack ProblemSynthetic COP instances
Optimality Gap0.00e+0
14
Knapsack ProblemKP n=100
Objective Value40.38
7
Showing 10 of 18 rows

Other info

Follow for update