Research map / Probabilistic and scientific modeling / Molecules and proteins
AlphaRoute: Large-Scale Coordinated Route Planning via Monte Carlo Tree Search
Guiyang Luo, Yantao Wang, Hui Zhang, Quan Yuan, Jinglin Li
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use region-level planning, graph-attention value evaluation, and MCTS | coordinated route planning · Beijing Sub-district | average travel latency (ALat): 399.93 -> 392.82 | Improved |
| use region-level planning, graph-attention value evaluation, and MCTS | coordinated route planning · Upper East Side, Manhattan | average travel latency (ALat): 744.60 -> 692.53 | Improved |
| use region-level planning, graph-attention value evaluation, and MCTS | coordinated route planning · Beijing Sub-district | average waiting time (AWai): 56.94 -> 50.83 | Improved |
| use region-level planning, graph-attention value evaluation, and MCTS | coordinated route planning · Upper East Side, Manhattan | average waiting time (AWai): 168.88 -> 161.70 | Improved |
| use region-level planning, graph-attention value evaluation, and MCTS | coordinated route planning · Beijing Sub-district | average travel distance (ADis): 6017.30 -> 6115.13 | Hurt |
| use region-level planning, graph-attention value evaluation, and MCTS | coordinated route planning · Upper East Side, Manhattan | average travel distance (ADis): 1798.48 -> 1806.97 | Hurt |
| use region-level planning, graph-attention value evaluation, and MCTS | coordinated route planning · Beijing Sub-district | average detour distance (ADet): 0.00 -> 97.83 | Hurt |
| use region-level planning, graph-attention value evaluation, and MCTS | coordinated route planning · Upper East Side, Manhattan | average detour distance (ADet): 0.00 -> 8.49 | Hurt |
| increase the number of partitioned regions (ablation) | AlphaRoute · Manhattan | average travel latency (ALat) | Improved |
| decrease the duration between successive steps (ablation) | AlphaRoute · Manhattan | average travel latency (ALat) | Improved |
| increase the number of states kept during pruning (ablation) | AlphaRoute · Manhattan | average travel latency (ALat) | Improved |
| use a learned graph neural network to approximate the value function (ablation) | AlphaRoute · Manhattan | average travel latency (ALat) | Improved |
Closest papers by meaning
- Semantic Routing via Autoregressive Modeling (NeurIPS 2024 · similarity 0.85)
- URB - Urban Routing Benchmark for RL-equipped Connected Autonomous Vehicles (NeurIPS 2025 · similarity 0.85)
- Compositional Monte Carlo Tree Diffusion for Extendable Planning (NeurIPS 2025 · similarity 0.84)
- Decentralized Monte Carlo Tree Search for Partially Observable Multi-Agent Pathfinding (AAAI 2024 · similarity 0.84)
- Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding (AAAI 2024 · similarity 0.84)
- Adaptive Anytime Multi-Agent Path Finding Using Bandit-Based Large Neighborhood Search (AAAI 2024 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
