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.
CITATION STYLE
Protaziuk, G., Piątkowski, R., & Bembenik, R. (2019). Modelling OpenStreetMap Data for Determination of the Fastest Route Under Varying Driving Conditions. In Studies in Big Data (Vol. 40, pp. 53–71). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-319-77604-0_5
Mendeley helps you to discover research relevant for your work.