Modelling OpenStreetMap Data for Determination of the Fastest Route Under Varying Driving Conditions

Chapter
Part of the Studies in Big Data book series (SBD, volume 40)

Abstract

We propose a network graph for determining the fastest route under varying driving conditions based on OpenStreetMap data. The introduced solution solves the fastest point-to-point path problem. We present a method of transformation the OpenStreetMap data into a network graph and a few transformation for improving the graph obtained by almost directly mapping the source data into a destination model. For determination of the fastest route we use the modified version of Dijkstra’s algorithm and a time-dependent model of network graph where the flow speed of each edge depends on the time interval.

Keywords

OpenStreetMap data Time-dependent network graph Fastest path 

References

  1. 1.
    Dean, B. C.: Shortest paths in fifo time-dependent networks: theory and algorithms. Rapport technique, Massachusetts Institute of Technology (2004)Google Scholar
  2. 2.
    Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische mathematik 1(1), 269–271 (1959)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Eglese, Richard, Maden, Will, Slater, Alan: A road timetabletm to aid vehicle routing and scheduling. Comput. Oper. Res. 33(12), 3508–3519 (2006)CrossRefGoogle Scholar
  4. 4.
    Gendreau, Michel, Ghiani, Gianpaolo, Guerriero, Emanuela: Time-dependent routing problems: a review. Comput. Oper. Res. 64, 189–197 (2015)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Huang, He, Gao, Song: Optimal paths in dynamic networks with dependent random link travel times. Transp. Res. Part B Methodol. 46(5), 579–598 (2012)CrossRefGoogle Scholar
  6. 6.
    Ichoua, Soumia, Gendreau, Michel, Potvin, Jean-Yves: Vehicle dispatching with time-dependent travel times. Eur. J. Oper. Res. 144(2), 379–396 (2003)CrossRefGoogle Scholar
  7. 7.
    Lindholm, T., Yellin, F., Bracha, G., Buckley, A.: The Java Virtual Machine Specification. Pearson Education, New Jersey (2014)Google Scholar
  8. 8.
    Miller-Hooks, E.D., Mahmassani, H.S.: Least expected time paths in stochastic, time-varying transportation networks. Transp. Sci. 34(2), 198–215 (2000)CrossRefGoogle Scholar
  9. 9.
    Nie, Y.M., Wu, X.: Shortest path problem considering on-time arrival probability. Transp. Res. Part B Methodol. 43(6), 597–613 (2009)CrossRefGoogle Scholar
  10. 10.
    Sheng, Yuhong, Gao, Yuan: Shortest path problem of uncertain random network. Comput. Ind. Eng. 99, 97–105 (2016)CrossRefGoogle Scholar
  11. 11.
    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)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Toth, P., Vigo, D.: Vehicle Routing: Problems, Methods, and Applications. SIAM (2014)Google Scholar
  13. 13.
    Wen, Liang, Çatay, Bülent, Eglese, Richard: Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge. Eur. J. Oper. Res. 236(3), 915–923 (2014)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Institute of Computer Science, Warsaw University of TechnologyWarsawPoland

Personalised recommendations