Skip to main content
SpringerLink
Log in

Fastest-Path Computation

  • Reference work entry
Encyclopedia of GIS

Synonyms

Fastest route; Driving direction; Shortest paths; Dijktra's shortest path algorithm; A* algorithm

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...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Recommended Reading

  1. Chabini, I.: Discrete Dynamic Shortest Path Problems in Transportation Applications. Trans Res Rec 1645, 170–175 (1998)

    Article  Google Scholar 

  2. Chakka, V.P., Everspaugh, A., Patel, J.M.: Indexing Large Trajectory Data Sets With SETI. In: Biennial Conf. on Innovative Data Systems Research (CIDR), Asilomar, CA, USA 2003

    Google Scholar 

  3. Huang, Y., Jing, N., Rundensteiner, E.: Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations. In: VLDB, Athens, Greece, pp. 396–405 (1997)

    Google Scholar 

  4. Jiang, B.: I/O-Efficiency of Shortest Path Algorithms: An Analysis. In: ICDE, pp. 12–19, Tempe, AZ, USA, 1992. IEEE Computer Society (1992)

    Google Scholar 

  5. Jing, N., Huang, Y.W., Rundensteiner, E.A.: Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation. TKDE 10(3):409–432 (1998)

    Google Scholar 

  6. Kamoun, F., Kleinrock, L.: Hierarchical Routing for Large Networks: Performance Evaluation and Optimization. Comput Netw 1:155–174 (1977)

    MathSciNet  Google Scholar 

  7. Kanoulas, E., Du, Y., Xia, T., Zhang, D.: Finding Fastest Paths on A Road Network with Speed Patterns. ICDE, Atlanta, GA, USA, 2006. IEEE Computer Society (2006)

    Google Scholar 

  8. Kung, R.M., Hanson, E.N., Ioannidis, Y.E., Sellis, T.K., Shapiro, L.D., Stonebraker, M.: Heuristic Search in Data Base Systems. In: Expert Database Systems Workshop (EDS), pp. 537–548 (1984)

    Google Scholar 

  9. Nachtigall, K.: Time depending shortest-path problems with applications to railway networks. Eur J Oper Res 83:154–166 (1995)

    Article  MATH  Google Scholar 

  10. Orda, A., Rom, R.: Minimum Weight Paths in Time‐Dependent Networks. In: Networks: An International Journal 21 (1991)

    Google Scholar 

  11. Pallottino, S., Scutellà, M.G.: Shortest Path Algorithms in Transportation Models: Classical and Innovative Aspects. In: Marcotte, P., Nguyen, S. (ed.) Equilibrium and Advanced Transportation Modelling, pp. 245–281. Kluwer Academic Publishers, New York (1998)

    Google Scholar 

  12. Shekhar, S., Fetterer, A., Goyal, B.: Materialization Trade-Offs in Hierarchical Shortest Path Algorithms. In: SSTD, pp. 94–111. Springer, Berlin (1997)

    Google Scholar 

  13. Shekhar, S., Kohli, A., Coyle, M.: Path Computation Algorithms for Advanced Traveller Information System (ATIS). In: ICDE, Vienna, Austria, 1993. IEEE Computer Society, pp. 31–39 (1993)

    Google Scholar 

  14. Sung, K., Bell, M.G.H., Seong, M., Park, S.: Shortest paths in a network with time‐dependent flow speeds. Eur J Oper Res 121(1), 32–39 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  15. Zhao, J.L., Zaki, A.: Spatial Data Traversal in Road Map Databases: A Graph Indexing Approach. In: Proc. of Int. Conf. on Information and Knowledge Management (CIKM), Gaithersburg, MD, USA, 1994. ACM, pp. 355–362 (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer & Information Science, Northeastern University, Boston, MA, USA

    Donghui Zhang

Authors
  1. Donghui Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Computer Science and Engineering, University of Minnesota, Minneapolis, MN, 55455, USA

    Shashi Shekhar (McKnight Distinguished University Professor) (McKnight Distinguished University Professor)

  2. Management Science and Information Systems Department, Rutgers Business School Newark and New Brunswick Rutgers, the State University of New Jersey, Newark, NJ, 07102, USA

    Hui Xiong (Assistant Professor) (Assistant Professor)

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Zhang, D. (2008). Fastest-Path Computation. In: Shekhar, S., Xiong, H. (eds) Encyclopedia of GIS. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35973-1_403

Download citation

Publish with us

Policies and ethics

Search

Navigation