arXiv Machine Learning August 5, 2026 By Reuben Narad, L\'eonard Boussioux, Michael Wagner

Beyond Solving: Prescriptive Probing for Neural Routing Solvers

Read the original on arXiv Machine Learning →

arXiv:2602. 07216v2 Announce Type: replace Abstract: Neural combinatorial optimization (NCO) trains fast heuristics for routing problems, but planners often need more than a single solve: they ask which stop to drop, which transition to preserve, or which subset of stops to remove if a route is infeasible.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv AI

Aug 25

Memory-Enhanced Neural Solvers for Routing Problems

The paper introduces MEMENTO, a memory‑enhanced neural solver that improves routing problem solutions by using online data from repeated attempts to adjust action distributions during inference. It targets NP‑hard routing tasks such as the Traveling Salesman and Capacitated Vehicle Routing problems, outperforming existing tree‑search and policy‑gradient fine‑tuning methods. MEMENTO demonstrates strong scalability and data efficiency, achieving state‑of‑the‑art results on 11 of 12 evaluated tasks and enabling zero‑shot integration with diversity‑based solvers.

By Felix Chalumeau, Refiloe Shabe, Noah De Nicola, Arnu Pretorius, Thomas D. Barrett, Nathan Grinsztajn

reinforcement-learning fine-tuning benchmarks

arXiv AI

3d ago

Understanding Decision-Making Mechanisms in Neural Routing Solvers

arXiv:2609.36063v1 Announce Type: cross Abstract: Neural Combinatorial Optimization (NCO) has achieved strong empirical success, yet the internal mechanisms driving model decisions remain largely une...

By Fatemeh Askari, Mazdak Teymourian, Mohammad Izadi, Mahdieh Soleymani Baghshah

safety

arXiv AI

Jun 2

Learning to Reduce Search Space for Generalizable Neural Routing Solver

arXiv:2503. 03137v3 Announce Type: replace Abstract: Constructive neural combinatorial optimization (NCO) offers a promising paradigm for solving vehicle routing problems (VRPs) by directly learning to construct approximate optimal solutions, thereby reducing reliance on expert knowledge for algorithm design.

By Changliang Zhou, Xi Lin, Zhenkun Wang, Qingfu Zhang

efficiency

arXiv AI

Jun 3

ASAP: Exploiting the Satisficing Generalization Edge in Neural Combinatorial Optimization

arXiv:2501. 17377v4 Announce Type: replace-cross Abstract: Deep Reinforcement Learning (DRL) has emerged as a promising approach for solving Combinatorial Optimization (CO) problems, such as the 3D Bin Packing Problem (3D-BPP), Traveling Salesman Problem (TSP), or Vehicle Routing Problem (VRP), but these neural solvers often exhibit brittleness when facing distribution shifts.

By Han Fang, Paul Weng, Yutong Ban

reinforcement-learning fine-tuning benchmarks

arXiv Computation and Language

Sep 22

Rubric-Guided Process Reward for Stepwise Model Routing

arXiv:2605.29310v2 Announce Type: replace-cross Abstract: Stepwise model routing improves the efficiency of Large Reasoning Models (LRMs) by assigning each reasoning step to a suitable model. Recent...

By Shenghao Ye, Yu Guo, Zhengheng Li, Shuangwu Chen, Jian Yang

reinforcement-learning benchmarks

arXiv Machine Learning

Aug 26

Improving Cross-Problem Vehicle Routing with Locally Augmented Preferences and Representation Disentanglement

arXiv:2608.24859v1 Announce Type: new Abstract: Multi-task vehicle routing problem (VRP) solvers seek to handle multiple VRP variants within a single unified model, avoiding the need to train a separ...

By Arthur Corr\^ea, Paulo Nascimento, Samuel Moniz

reinforcement-learning benchmarks

One email a morning, machine-written

Related stories

Memory-Enhanced Neural Solvers for Routing Problems

Understanding Decision-Making Mechanisms in Neural Routing Solvers

Learning to Reduce Search Space for Generalizable Neural Routing Solver

ASAP: Exploiting the Satisficing Generalization Edge in Neural Combinatorial Optimization

Rubric-Guided Process Reward for Stepwise Model Routing

Improving Cross-Problem Vehicle Routing with Locally Augmented Preferences and Representation Disentanglement