Bridging Synthetic and Real Routing Problems via LLM-Guided Instance Generation and Progressive Adaptation
Not on the map. Why?
Abstract (arXiv)
Recent advances in Neural Combinatorial Optimization (NCO) methods have significantly improved the capability of neural solvers to handle synthetic routing instances. Nonetheless, existing neural solvers typically struggle to generalize effectively from synthetic, uniformly-distributed training data to real-world VRP scenarios, including widely recognized benchmark instances from TSPLib and CVRPLib. To bridge this generalization gap, we present Evolutionary Realistic Instance Synthesis (EvoReal), which leverages an evolutionary module guided by large language models (LLMs) to generate synthetic instances characterized by diverse and realistic structural patterns. Specifically, the evolutionary module produces synthetic instances whose structural attributes statistically mimics those observed in authentic real-world instances. Subsequently, pre-trained NCO models are progressively refined, firstly aligning them with these structurally enriched synthetic distributions and then further adapting them through direct fine-tuning on actual benchmark instances. Extensive experimental evaluations demonstrate that EvoReal markedly improves the generalization capabilities of state-of-the-art neural solvers, yielding a notable reduced performance gap compared to the optimal solutions on the TSPLib (1.05%) and CVRPLib (2.71%) benchmarks across a broad spectrum of problem scales.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 28 of its 51 references that are in the map. First posted on arXiv 13 Nov 2025.
Builds on
28 of 51 references.
References · 28
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2015Pointer Networkscited by 895
- 2018Attention, Learn to Solve Routing Problems!cited by 656
- 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 623
- 2016Neural Combinatorial Optimization with Reinforcement Learningcited by 608
- 2018Reinforcement Learning for Solving the Vehicle Routing Problemcited by 333
- 2024ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolutioncited by 276
- 2021Combinatorial optimization and reasoning with graph neural networkscited by 268
- 2023Can Language Models Solve Graph Problems in Natural Language?cited by 252
- 2023DIFUSCO: Graph-based Diffusion Solvers for Combinatorial Optimizationcited by 221
- 2023Neural Combinatorial Optimization with Heavy Decoder: Toward Large Scale Generalizationcited by 142
- 2020Hybrid Genetic Search for the CVRP: Open-Source Implementation and SWAP* Neighborhoodcited by 125
16 more
- 2023Large Language Models as Evolutionary Optimizerscited by 124
- 2022Sym-NCO: Leveraging Symmetricity for Neural Combinatorial Optimizationcited by 119
- 2022Simulation-guided Beam Search for Neural Combinatorial Optimizationcited by 84
- 2023BQ-NCO: Bisimulation Quotienting for Efficient Neural Combinatorial Optimizationcited by 82
- 2023Learning to Search Feasible and Infeasible Regions of Routing Problems with Flexible Neural k-Optcited by 81
- 2023Towards Generalizable Neural Solvers for Vehicle Routing Problems via Ensemble with Transferrable Local Policycited by 62
- 2023Combinatorial Optimization with Policy Adaptation using Latent Space Searchcited by 41
- 2024PolyNet: Learning Diverse Solution Strategies for Neural Combinatorial Optimizationcited by 35
- 2025Large Language Models as End-to-end Combinatorial Optimization Solverscited by 28
- 2023Meta-SAGE: Scale Meta-Learning Scheduled Adaptation with Guided Exploration for Mitigating Scale Shift on Combinatorial Optimizationcited by 23
- 2024Can LLMs Solve longer Math Word Problems Better?cited by 22
- 2024Self-Guiding Exploration for Combinatorial Problemscited by 22
- 2024Visual Reasoning and Multi-Agent Approach in Multimodal Large Language Models (MLLMs): Solving TSP and mTSP Combinatorial Challengescited by 21
- 2020Evaluating Curriculum Learning Strategies in Neural Combinatorial Optimizationcited by 19
- 2023Neural Multi-Objective Combinatorial Optimization with Diversity Enhancementcited by 13
- 2024Self-Refinement of Language Models from External Proxy Metrics Feedbackcited by 9
Built on by
Citing papers per year: 2026: 3.
3 papers.
- 2026DRAGON: LLM-Driven Decomposition and Reconstruction Agents for Large-Scale Combinatorial Optimizationcited by 3
- 2026Hard Constraints Meet Soft Generation: Guaranteed Feasibility for LLM-based Combinatorial Optimizationcited by 3
- 2026SimpleEvol: An Agent-Loop Framework for LLM-Driven Automated Heuristic Design with Minimal Human Priorscited by 0
- 2026SimpleEvol: An Agent-Loop Framework for LLM-Driven Automated Heuristic Design with Minimal Human Priors29 Sep 2026
- 2026Hard Constraints Meet Soft Generation: Guaranteed Feasibility for LLM-based Combinatorial Optimization1 Feb 2026
- 2026DRAGON: LLM-Driven Decomposition and Reconstruction Agents for Large-Scale Combinatorial Optimization10 Jan 2026