Research map / Learning theory and algorithms / Prediction and decision losses
Improved Algorithms for Trip-Vehicle Assignment in Ride-Sharing
Jingyang Zhao, Mingyu Xiao, Yonghang Su
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 ALG.1 (k-path partition) instead of LADG | ride-sharing assignment (n = mk) · synthetic clustered Gaussian instances, n = mk | solution weight (total travel distance) | Improved |
| use ALG.2 (constrained spanning forest) instead of LADG | ride-sharing assignment (n = mk) · synthetic clustered Gaussian instances, n = mk | solution weight (total travel distance) | Improved |
| use ALG.2 instead of ALG.1 | ride-sharing assignment (n = mk) · synthetic instances, n = mk | solution weight and running time: runtime roughly four times that of ALG.1 | Hurt |
| vary vehicle capacity k to non-powers of 2 for LADG (ablation) | LADG · synthetic instances, n = mk | solution weight | Hurt |
| vary vehicle capacity k for ALG.1 and ALG.2 (ablation) | ALG.1, ALG.2 · synthetic instances, n = mk | solution weight | No clear effect |
| vary number of cluster centers c and covariance sigma^2 (ablation) | ALG.1, ALG.2, LADG · synthetic instances, n = mk | solution weight | No clear effect |
| evaluate all k edge pairs when choosing the vehicle entry route instead of a fixed pair (ablation) | ALG.1, ALG.2 implementation · synthetic instances, n = mk | runtime | No clear effect |
Closest papers by meaning
- Algorithms for Trip-Vehicle Assignment in Ride-Sharing (AAAI 2018 · similarity 0.84)
- Optimizing Ride-Pooling Operations with Extended Pickup and Drop-Off Flexibility (AAAI 2026 · similarity 0.80)
- Neural Approximate Dynamic Programming for On-Demand Ride-Pooling (AAAI 2020 · similarity 0.80)
- Community-Based Trip Sharing for Urban Commuting (AAAI 2018 · similarity 0.79)
- One Step is Enough: Multi-Agent Reinforcement Learning Based on One-Step Policy Optimization for Order Dispatch on Ride-Sharing Platforms (NeurIPS 2026 · similarity 0.74)
- Hierarchical Optimization via LLM-Guided Objective Evolution for Mobility-on-Demand Systems (NeurIPS 2025 · similarity 0.74)
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.
