SOURCE-LINKED INTELLIGENCE

COMPASS: Ordered Clustered Routing at 100K Scale

arXiv · AI, language, vision and robotics · article · Sep 17, 2026 · UTC

Large-scale routing often requires visiting clusters of nodes in a prescribed order, giving rise to the Ordered Clustered Traveling Salesman Problem (OCTSP). Optimizing each cluster independently seems natural, but misses non-local dependencies. We introduce the COMPASS algorithm for OCTSP, which combines search with learning-accelerated routing by orchestrating parallel sub-solvers. COMPASS has no quality ceiling and its solutions keep improving with compute. It exploits the clustered structure, and can reach exact solutions in time exponential in cluster size rather than instance size. Empir

Read original source ↗ Open in workspace

recordType

paper

region

Global