arXiv AI
Just Initialize: A Training-Free Initialization Component for Large-Scale Routing Optimization
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
Jul 7
Robust Feasible Route Construction through Collaborative Partition Optimization
arXiv:2607. 03694v1 Announce Type: new Abstract: Large-scale Capacitated Vehicle Routing Problems (CVRPs) are commonly solved by partitioning customers into smaller routing problems that can be optimized independently.
arXiv AI
Jun 18
Enhancing CVRP Solver through LLM-driven Automatic Heuristic Design
arXiv:2602. 23092v2 Announce Type: replace Abstract: The Capacitated Vehicle Routing Problem (CVRP), a fundamental combinatorial optimization challenge, focuses on optimizing fleet operations under vehicle capacity constraints.
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 Machine Learning
Sep 18
COMPASS: Ordered Clustered Routing at 100K Scale
The paper introduces COMPASS, an algorithm for the Ordered Clustered Traveling Salesman Problem (OCTSP) that combines search with learning-accelerated routing through parallel sub-solvers. COMPASS improves solutions continuously with more compute, exploits clustered structure to achieve exact solutions in time exponential in cluster size, and outperforms existing methods. It works with general distance matrices, not just coordinate inputs, and scales to 100,000 synthetic nodes and 28,500 real e-commerce nodes, representing the largest reported routing solution over asymmetric distances.
Hugging Face Trending Papers
Sep 17
COMPASS: Ordered Clustered Routing at 100K Scale
COMPASS is a new algorithm for the Ordered Clustered Traveling Salesman Problem (OCTSP) that combines search with learning‑accelerated routing by orchestrating parallel sub‑solvers. It exploits the clustered structure to achieve exact solutions in time exponential in cluster size rather than instance size, and its solutions improve continuously with more compute. Empirically, COMPASS outperforms existing methods and scales to 100K synthetic nodes and 28.5K real e‑commerce nodes, representing the largest reported routing solution over asymmetric distances—9× beyond established ATSP benchmarks.