COMPASS: Ordered Clustered Routing at 100K Scale

2026-09-17

AI Summary

研究解决了大规模有序聚类路径问题，通过COMPASS算法结合搜索与学习加速路由，有效处理10万规模节点的路径优化。

Abstract

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. Empirically, COMPASS consistently outperforms alternative methods. Unlike common large-scale routing solvers, COMPASS consumes general distance matrices and is not limited to coordinate inputs. We demonstrate scaling to 100K synthetic nodes and to 28.5K real e-commerce nodes. To our knowledge, the latter is the largest reported routing solution over asymmetric distances, 9x beyond established ATSP benchmarks.

Problem

• Ordered Clustered Traveling Salesman Problem
• OCTSP
• large-scale routing

Innovation

• Ordered Clustered Traveling Salesman Problem
• learning-accelerated routing
• parallel sub-solvers