arXiv AI
Size Generalization for Diffusion Routing Solvers
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
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.
arXiv AI
Sep 30
Just Initialize: A Training-Free Initialization Component for Large-Scale Routing Optimization
arXiv:2609.35443v2 Announce Type: replace Abstract: Large-scale routing problems are difficult to solve efficiently as their search spaces grow rapidly with problem size. Existing approaches primaril...
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.
arXiv Machine Learning
Aug 17
Smart routes: a system for development and comparison of algorithms for solving vehicle routing problems with realistic constraints
arXiv:2608. 14140v1 Announce Type: new Abstract: The problem of route optimization with realistic constraints is becoming extremely relevant in the face of global urban population growth.
arXiv AI
Jun 9
IDEQ -- Improving Diffusion Models for the Traveling Salesman Problem (TSP) by Leveraging the Structure of the Solution Space
arXiv:2412. 13858v2 Announce Type: replace Abstract: We investigate diffusion models to solve the Traveling Salesman Problem.
arXiv AI
4d ago
GREAT-ESDD: Graph Edge Attention Network for Effectively Steered Delivery Decisions
arXiv:2610.14792v1 Announce Type: new Abstract: Online, same-day delivery requires operators to constantly update their routes, and the routing cost for deliveries increases with the number of custom...