A Hierarchical Grouping Algorithm for the Multi-Vehicle Dial-a-Ride Problem
Summary: Introduces HGR, the first non-trivial approximation algorithm for the Multi-Vehicle Dial-a-Ride Problem via a reduction to a capacitated partitioning problem solved by a novel hierarchical grouping scheme. Empirically yields lower total travel distance and reduced in-transit latency versus baselines. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Kelin Luo (University of Bonn)
- 2. Alexandre M. Florio (Polytechnique Montreal)
- 3. Syamantak Das (Indraprastha Institute of Information Technology Delhi)
- 4. Xiangyu Guo (State University of New York at Buffalo)
BibTeX Citation
@article{luo_vldb23,
title = {{A Hierarchical Grouping Algorithm for the Multi-Vehicle Dial-a-Ride Problem}},
author = {Luo, Kelin and Florio, Alexandre M. and Das, Syamantak and Guo, Xiangyu},
journal = {PVLDB},
series = {{VLDB} '23},
volume = {16},
number = {5},
pages = {1195--1207},
doi = {10.14778/3579075.3579091},
url = {https://doi.org/10.14778/3579075.3579091},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,035 | Large Scale Real-time Ridesharing with Service Guarantee on Road Networks | 2014 | VLDB | 0.00012505885 |
| 2,945 | A Unified Approach to Route Planning for Shared Mobility | 2018 | VLDB | 7.9331237e-05 |
| 3,084 | Order Dispatch in Price-aware Ridesharing | 2018 | VLDB | 7.7713936e-05 |
| 6,302 | Last-Mile Delivery Made Practical: An Efficient Route Planning Framework with Theoretical Guarantees | 2020 | VLDB | 5.9213518e-05 |
| 6,829 | Utility-Aware Ridesharing on Road Networks | 2017 | SIGMOD | 5.7600666e-05 |
| 7,084 | The Simpler The Better: An Indexing Approach for Shared-Route Planning Queries | 2020 | VLDB | 5.7074102e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,611 | Online Ridesharing with Meeting Points | 2022 | VLDB |
| 2 | 13,452 | A Queueing-Theoretic Framework for Vehicle Dispatching in Dynamic Car-Hailing | 2021 | VLDB |
| 3 | 9,814 | Real-time Insertion Operator for Shared Mobility on Time-Dependent Road Networks | 2024 | VLDB |
| 4 | 7,084 | The Simpler The Better: An Indexing Approach for Shared-Route Planning Queries | 2020 | VLDB |
| 5 | 3,084 | Order Dispatch in Price-aware Ridesharing | 2018 | VLDB |
| 6 | 7,674 | Ridesharing: Simulator, Benchmark, and Evaluation | 2019 | VLDB |
| 7 | 2,945 | A Unified Approach to Route Planning for Shared Mobility | 2018 | VLDB |
| 8 | 1,035 | Large Scale Real-time Ridesharing with Service Guarantee on Road Networks | 2014 | VLDB |
| 9 | 7,283 | Demand-Aware Route Planning for Shared Mobility Services | 2020 | VLDB |
| 10 | 6,829 | Utility-Aware Ridesharing on Road Networks | 2017 | SIGMOD |