arXiv (All)
open access
An Empirical Survey and Benchmark of Learned Distance Indexes for Road Networks
The calculation of shortest-path distances in road networks is a core operation in navigation systems, location-based services, and spatial analytics. Although classical algorithms, e.g., Dijkstra's algorithm, provide exact answers, their latency is prohibitive for modern real-time, large-scale depl
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Joint coordination and routing of autonomous vehicles in road networks with machine learning-based travel time forecasting#388275
- Learning Constraints-Based Adaptive Hypergraph Neural Networks for Solving Vehicle Routing Problems#925753
- Customizable and Jointly Optimized Route Planning: A Deep Architecture Enabling Differentiable Shortest-Path Search#1033778
- An evaluation of current high-performance networks#612028
- Road traffic performance by traffic and registration location, type of vehicle and motor energy (until 2012)#817435
Record · ID 1048570
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive