Database Paper Browser

Back to papers

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)

Paper ID
12987
Venue
VLDB
Year
2023
Pagerank
4.1945683e-05
Overall Rank
11,228 | 21.89%
DOI
10.14778/3579075.3579091

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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.

Previous Page 1 / 1 Next

Semantically Similar Papers