Definition
In the United states, only 9.3 % of the households do not have cars. Driving is part of people’s daily life. GIS systems like MapQuest and MapPoint are heavily relied on to provide driving directions. However, surprisingly enough, existing systems either ignore the driving speed on road networks or assume that the speed remains constant on the road segments. In both cases, the users’ preferred leaving time does not affect the query result. For instance, MapQuest does not ask the users to input the day and time of driving. However, during rush hour, inbound highways to big cities allow much lower speeds than usual. Therefore, a fastest path computed during non-rush hours, which may consist of some inbound highway segments, may not remain the fastest path during rush hour.
Consider a road network modeled as a graph where each node is a road intersection and each edge is a...
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chabini I (1998) Discrete dynamic shortest path problems in transportation applications. Transp Res Rec 1645:170–175
Chakka VP, Everspaugh A, Patel JM (2003) Indexing large trajectory data sets with SETI. In: Biennial conference on innovative data systems research (CIDR), Asilomar
Huang Y, Jing N, Rundensteiner E (1997) Spatial joins using R-trees: breadth-first traversal with global optimizations. In: VLDB, Athens, pp 396–405
Jiang B (1992) I/O-efficiency of shortest path algorithms: an analysis. In: ICDE, Tempe. IEEE Computer Society, pp 12–19
Jing N, Huang YW, Rundensteiner EA (1998) Hierarchical encoded path views for path query processing: an optimal model and its performance evaluation. TKDE 10(3):409–432
Kamoun F, Kleinrock L (1977) Hierarchical routing for large networks: performance evaluation and optimization. Comput Netw 1:155–174
Kanoulas E, Du Y, Xia T, Zhang D (2006) Finding fastest paths on a road network with speed patterns. In: ICDE, Atlanta. IEEE Computer Society
Kung RM, Hanson EN, Ioannidis YE, Sellis TK, Shapiro LD, Stonebraker M (1984) Heuristic search in data base systems. In: Expert database systems workshop (EDS), Kiawah Island, pp 537–548
Nachtigall K (1995) Time depending shortest-path problems with applications to railway networks. Eur J Oper Res 83:154–166
Orda A, Rom R (1991) Minimum weight paths in timedependent networks. Networks Int J 21:295–320
Pallottino S, Scutellà MG (1998) Shortest path algorithms in transportation models: classical and innovative aspects. In: Marcotte P, Nguyen S (eds) Equilibrium and advanced transportation modelling. Kluwer Academic Publishers, New York, pp 245–281
Shekhar S, Fetterer A, Goyal B (1997) Materialization trade-offs in hierarchical shortest path algorithms. In: SSTD. Springer, Berlin, pp 94–111
Shekhar S, Kohli A, Coyle M (1993) Path computation algorithms for advanced traveller information system (ATIS). In: ICDE, Vienna. IEEE Computer Society, pp 31–39
Sung K, Bell MGH, Seong M, Park S (2000) Shortest paths in a network with timedependent flow speeds. Eur J Oper Res 121(1):32–39
Zhao JL, Zaki A (1994) Spatial data traversal in road map databases: a graph indexing approach. In: Proceedings of international conference on information and knowledge management (CIKM), Gaithersburg. ACM, pp 355–362
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this entry
Cite this entry
Zhang, D. (2017). Fastest-Path Computation. In: Shekhar, S., Xiong, H., Zhou, X. (eds) Encyclopedia of GIS. Springer, Cham. https://doi.org/10.1007/978-3-319-17885-1_403
Download citation
DOI: https://doi.org/10.1007/978-3-319-17885-1_403
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-17884-4
Online ISBN: 978-3-319-17885-1
eBook Packages: Computer ScienceReference Module Computer Science and Engineering