Minimal On-Road Time Route Scheduling on Time-Dependent Graphs
Summary: Enables minimal on-road time routing on time-dependent graphs by waiting at parking vertices, breaking FIFO. Gives two algorithms via a minimum on-road cost; evaluations on real graphs show improved accuracy and speed, with parking cutting on-road time. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Lei Li (University of Queensland)
- 2. Wen Hua (University of Queensland)
- 3. Xingzhong Du (University of Queensland)
- 4. Xiaofang Zhou (Soochow University; University of Queensland)
BibTeX Citation
@article{li_vldb17,
title = {{Minimal On-Road Time Route Scheduling on Time-Dependent Graphs}},
author = {Li, Lei and Hua, Wen and Du, Xingzhong and Zhou, Xiaofang},
journal = {PVLDB},
series = {{VLDB} '17},
volume = {10},
number = {11},
pages = {1274--1287},
doi = {10.14778/3137628.3137636},
url = {https://doi.org/10.14778/3137628.3137636},
year = {2017}
}Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,722 | Querying Shortest Paths on Time Dependent Road Networks | 2019 | VLDB | 9.7932895e-05 |
| 4,340 | Constrained Shortest Path Query in a Large Time-Dependent Graph | 2019 | VLDB | 6.6518685e-05 |
| 4,906 | Diversified Top-k Route Planning in Road Network | 2022 | VLDB | 6.3616468e-05 |
| 6,988 | An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network | 2021 | VLDB | 5.6274541e-05 |
| 9,543 | FHL-Cube: Multi-Constraint Shortest Path Querying with Flexible Combination of Constraints | 2022 | VLDB | 5.1614165e-05 |
| 11,263 | Continuous Lifelong Conflict-Aware AGV Routing with Kinematic Constraints | 2025 | VLDB | 4.9793485e-05 |
| 13,595 | A Demonstration of Continuous Lifelong Conflict-Aware AGV Routing with Kinematic Constraints | 2026 | VLDB | - |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 953 | Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation | 2012 | VLDB | 0.00012877507 |
| 1,105 | Path Problems in Temporal Graphs | 2014 | VLDB | 0.00011996469 |
| 1,621 | Efficient Route Planning on Public Transportation Networks: A Labelling Approach | 2015 | SIGMOD | 0.00010054061 |
| 2,602 | Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks | 2017 | VLDB | 8.2325477e-05 |
| 4,604 | Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs | 2014 | VLDB | 6.505032e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,621 | Efficient Route Planning on Public Transportation Networks: A Labelling Approach | 2015 | SIGMOD |
| 2 | 8,562 | Path Cost Distribution Estimation Using Trajectory Data | 2017 | VLDB |
| 3 | 9,407 | Continuously Monitoring Alternative Shortest Paths on Road Networks | 2020 | VLDB |
| 4 | 6,815 | Efficient Algorithms for Optimal Location Queries in Road Networks | 2014 | SIGMOD |
| 5 | 5,150 | Minimum Spanning Trees in Temporal Graphs | 2015 | SIGMOD |
| 6 | 1,722 | Querying Shortest Paths on Time Dependent Road Networks | 2019 | VLDB |
| 7 | 4,340 | Constrained Shortest Path Query in a Large Time-Dependent Graph | 2019 | VLDB |
| 8 | 10,003 | Real-time Insertion Operator for Shared Mobility on Time-Dependent Road Networks | 2024 | VLDB |
| 9 | 1,105 | Path Problems in Temporal Graphs | 2014 | VLDB |
| 10 | 4,604 | Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs | 2014 | VLDB |