research-article

Time-dependent route scheduling on road networks

Authors:

Xiaofang ZhouAuthors Info & Claims

SIGSPATIAL Special, Volume 10, Issue 1

Pages 10 - 14

https://doi.org/10.1145/3231541.3231545

Published: 05 June 2018 Publication History

Abstract

Navigation has been an important tool for human civilization for thousands of years, and the latest technologies like online map services and GPS satellites have brought it up to a new level. Now people can easily identify where we are on earth, find any places they want to go, and retrieve best routes to get there. Although there are plenty of tools that are convenient and fast enough for basic uses, it is still far from optimal. For example, most systems only consider various type of distances as the optimization goals, while the traveling time, which needs to consider traffic conditions, is a more appropriate one. However, it is both hard to acquire the traffic condition information and to compute time-dependent fastest paths. Therefore, in this article, we present an introduction to the time-dependent route scheduling, from speed profile generation to route scheduling and query answering.

References

[1]

G. V. Batz, R. Geisberger, S. Neubauer, and P. Sanders. Time-dependent contraction hierarchies and approximation. In International Symposium on Experimental Algorithms, pages 166--177. Springer, 2010.

Digital Library

[2]

E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. SIAM Journal on Computing, 32(5):1338--1355, 2003.

Digital Library

[3]

D. Delling. Time-dependent sharc-routing. In European Symposium on Algorithms, pages 332--343. Springer, 2008.

Digital Library

[4]

E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische mathematik, 1(1):269--271, 1959.

Digital Library

[5]

B. Ding, J. X. Yu, and L. Qin. Finding time-dependent shortest paths over large graphs. In Proceedings of the 11th international conference on Extending database technology: Advances in database technology, pages 205--216. ACM, 2008.

Digital Library

[6]

S. E. Dreyfus. An appraisal of some shortest-path algorithms. Operations research, 17(3):395--412, 1969.

Digital Library

[7]

P. Esling and C. Agon. Time-series data mining. ACM Computing Surveys (CSUR), 45(1):12, 2012.

Digital Library

[8]

L. Foschini, J. Hershberger, and S. Suri. On the complexity of time-dependent shortest paths. Algorithmica, 68(4):1075--1097, 2014.

[9]

A. V. Goldberg and C. Harrelson. Computing the shortest path: A search meets graph theory. In Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pages 156--165. Society for Industrial and Applied Mathematics, 2005.

Digital Library

[10]

E. Kanoulas, Y. Du, T. Xia, and D. Zhang. Finding fastest paths on a road network with speed patterns. In Data Engineering, 2006. ICDE'06. Proceedings of the 22nd International Conference on, pages 10--10. IEEE, 2006.

Digital Library

[11]

L. Li, W. Hua, X. Du, and X. Zhou. Minimal on-road time route scheduling on time-dependent graphs. Proceedings of the VLDB Endowment, 10(11):1274--1285, 2017.

Digital Library

[12]

L. Li, K. Zheng, S. Wang, W. Hua, and X. Zhou. Go slow to go fast: minimal on-road time route scheduling with parking facilities using historical trajectory. The VLDB Journal, pages 1--25, 2018.

Digital Library

[13]

L. Li, X. Zhou, and K. Zheng. Finding least on-road travel time on road network. In Australasian Database Conference, pages 137--149. Springer, 2016.

[14]

J. Shang, Y. Zheng, W. Tong, E. Chang, and Y. Yu. Inferring gas consumption and pollution emission of vehicles throughout a city. In Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 1027--1036. ACM, 2014.

Digital Library

[15]

L. Wu, X. Xiao, D. Deng, G. Cong, A. D. Zhu, and S. Zhou. Shortest path and distance queries on road networks: An experimental evaluation. Proceedings of the VLDB Endowment, 5(5):406--417, 2012.

Digital Library

[16]

J. Yuan, Y. Zheng, C. Zhang, X. Xie, and G.-Z. Sun. An interactive-voting based map matching algorithm. In Mobile Data Management (MDM), 2010 Eleventh International Conference on, pages 43--52. IEEE, 2010.

Digital Library

Cited By

Xu YLi LZhang MXu ZZhou X(2024)Global Optimal Travel Planning for Massive Travel Queries in Road NetworksIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2024.343940936:12(8377-8394)Online publication date: 1-Dec-2024
https://dl.acm.org/doi/10.1109/TKDE.2024.3439409
Xu YLi LZhang MXu ZZhou X(2023)Global Routing Optimization In Road Networks2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00194(2524-2537)Online publication date: May-2023
https://doi.org/10.1109/ICDE55515.2023.00194
Shi DZhou NTong YZhou ZXu YXu K(2023)Collision-Aware Route Planning in Warehouses Made Efficient: A Strip-based Framework2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00072(869-881)Online publication date: May-2023
https://doi.org/10.1109/ICDE55515.2023.00072
Show More Cited By

Recommendations

TRoute: Dynamic Time-Dependent Route Recommendation on Road Networks
Web Information Systems and Applications
Abstract
Recommending routes for different origin-destination pairs poses a significant challenge in transportation and logistics. Traditional algorithms often overlook time-dependent reachable time, which is influenced by dynamic traffic conditions and ...
Scheduling time-dependent jobs under mixed deterioration

We consider a new model of time-dependent scheduling. A set of deteriorating jobs has to be processed on a single machine which is available starting from a non-zero time. The processing times of some jobs from this set are constant, while other ones ...
Optimal time-dependent sequenced route queries in road networks
SIGSPATIAL '15: Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems

In this paper we present an algorithm for optimal processing of time-dependent sequenced route queries in road networks, i.e., given a road network where the travel time over an edge is time-dependent and a given ordered list of categories of interest, ...

Comments

Information & Contributors

Information

Published In

cover image SIGSPATIAL Special

SIGSPATIAL Special Volume 10, Issue 1

March 2018

26 pages

EISSN:1946-7729

DOI:10.1145/3231541

Editor:
Andreas Züfle
George Mason University

Issue’s Table of Contents

Copyright © 2018 Authors.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 June 2018

Published in SIGSPATIAL Volume 10, Issue 1

Check for updates

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
202
Total Downloads

Downloads (Last 12 months)10
Downloads (Last 6 weeks)3

Reflects downloads up to 28 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Xu YLi LZhang MXu ZZhou X(2024)Global Optimal Travel Planning for Massive Travel Queries in Road NetworksIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2024.343940936:12(8377-8394)Online publication date: 1-Dec-2024
https://dl.acm.org/doi/10.1109/TKDE.2024.3439409
Xu YLi LZhang MXu ZZhou X(2023)Global Routing Optimization In Road Networks2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00194(2524-2537)Online publication date: May-2023
https://doi.org/10.1109/ICDE55515.2023.00194
Shi DZhou NTong YZhou ZXu YXu K(2023)Collision-Aware Route Planning in Warehouses Made Efficient: A Strip-based Framework2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00072(869-881)Online publication date: May-2023
https://doi.org/10.1109/ICDE55515.2023.00072
Li JNi CHe DLi LXia XZhou X(2023)Efficient kNN query for moving objects on time-dependent road networksThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-022-00758-w32:3(575-594)Online publication date: 1-May-2023
https://dl.acm.org/doi/10.1007/s00778-022-00758-w
Li LWang SZhou X(2022)Fastest Path Query Answering using Time-Dependent Hop-Labeling in Road NetworkIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2020.298106234:1(300-313)Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1109/TKDE.2020.2981062
Liao LYang SLai YZeng WYang FJiang M(2021)Efficient Estimation of Time-Dependent Shortest Paths Based on ShortcutsAlgorithms and Architectures for Parallel Processing10.1007/978-3-030-95388-1_2(18-32)Online publication date: 3-Dec-2021
https://dl.acm.org/doi/10.1007/978-3-030-95388-1_2
Li LZhang MHua WZhou X(2020)Fast Query Decomposition for Batch Shortest Path Processing in Road Networks2020 IEEE 36th International Conference on Data Engineering (ICDE)10.1109/ICDE48307.2020.00107(1189-1200)Online publication date: May-2020
https://doi.org/10.1109/ICDE48307.2020.00107
Zhang MLi LHua WZhou X(2020)Typical Snapshots Selection for Shortest Path Query in Dynamic Road NetworksDatabases Theory and Applications10.1007/978-3-030-39469-1_9(105-120)Online publication date: 3-Feb-2020
https://dl.acm.org/doi/10.1007/978-3-030-39469-1_9
Wang YLi GTang N(2019)Querying shortest paths on time dependent road networksProceedings of the VLDB Endowment10.14778/3342263.334226512:11(1249-1261)Online publication date: 1-Jul-2019
https://dl.acm.org/doi/10.14778/3342263.3342265
Zhang MLi LHua WZhou X(2019)Efficient Batch Processing of Shortest Path Queries in Road Networks2019 20th IEEE International Conference on Mobile Data Management (MDM)10.1109/MDM.2019.00-69(100-105)Online publication date: Jul-2019
https://doi.org/10.1109/MDM.2019.00-69
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents