Modelling OpenStreetMap Data for Determination of the Fastest Route Under Varying Driving Conditions
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.
KeywordsOpenStreetMap data Time-dependent network graph Fastest path
- 1.Dean, B. C.: Shortest paths in fifo time-dependent networks: theory and algorithms. Rapport technique, Massachusetts Institute of Technology (2004)Google Scholar
- 7.Lindholm, T., Yellin, F., Bracha, G., Buckley, A.: The Java Virtual Machine Specification. Pearson Education, New Jersey (2014)Google Scholar
- 12.Toth, P., Vigo, D.: Vehicle Routing: Problems, Methods, and Applications. SIAM (2014)Google Scholar