arXiv (All)
open access
Customizable and Jointly Optimized Route Planning: A Deep Architecture Enabling Differentiable Shortest-Path Search
With the widespread use of online navigation and ride-hailing services, achieving optimal route planning for diverse user preferences has recently attracted increasing attention. Classic graph algorithms for pathfinding use heuristic cost functions to define edge weight, thus providing no optimality
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
- Default Router Preferences and More-Specific Routes#500572
- JointMatch: A Unified Heterogeneous Graph Neural Solver for Large-Scale Ride-Sharing Matching#1033970
- An Empirical Survey and Benchmark of Learned Distance Indexes for Road Networks#1048570
- L2R: Low-Rank and Lipschitz-Controlled Routing for Mixture-of-Experts#1013503
- Optimal urban mobility network design for sustainable space sharing between vehicles and soft transport modes#280496
Record · ID 1033778
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