arXiv (All)
open access
JointMatch: A Unified Heterogeneous Graph Neural Solver for Large-Scale Ride-Sharing Matching
Ride-sharing platforms must continuously decide which open requests to bundle into shared trips and which idle vehicles should serve them. The dominant academic approach decomposes this into two sequential matching problems -- request pairing first, then vehicle assignment -- and applies a separate
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
- Customizable and Jointly Optimized Route Planning: A Deep Architecture Enabling Differentiable Shortest-Path Search#1033778
- Replication Failure and Trivial Baselines in Road-Level Crash Prediction#1130759
- RouteRec: Behavior-Guided Sparse Routing for Sequential Recommendation#1143974
- Sequence Variables: A Constraint Programming Computational Domain for Routing and Sequencing#1131418
- Optimal urban mobility network design for sustainable space sharing between vehicles and soft transport modes#280496
Record · ID 1033970
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