Next Article in Journal
Modelling and Visualizing Holographic 3D Geographical Scenes with Timely Data Based on the HoloLens
Previous Article in Journal
DEM-Based Vs30 Map and Terrain Surface Classification in Nationwide Scale—A Case Study in Iran
Open AccessArticle

The ε-Approximation of the Time-Dependent Shortest Path Problem Solution for All Departure Times

1
Department of Geomatics, University of West Bohemia, Univerzitní 2732/8, 301 00 Plzeň, Czech Republic
2
Department of Computer Science, University of West Bohemia, Univerzitní 2732/8, 301 00 Plzeň, Czech Republic
*
Author to whom correspondence should be addressed.
ISPRS Int. J. Geo-Inf. 2019, 8(12), 538; https://doi.org/10.3390/ijgi8120538
Received: 30 September 2019 / Revised: 22 November 2019 / Accepted: 24 November 2019 / Published: 27 November 2019
In this paper, the shortest paths search for all departure times (profile search) are discussed. This problem is called a time-dependent shortest path problem (TDSP) and is suitable for time-dependent travel-time analysis. Particularly, this paper deals with the ε -approximation of profile search computation. The proposed algorithms are based on a label correcting modification of Dijkstra’s algorithm (LCA). The main idea of the algorithm is to simplify the arrival function after every relaxation step so that the maximum relative error is maintained. When the maximum relative error is 0.001, the proposed solution saves more than 97% of breakpoints and 80% of time compared to the exact version of LCA. Furthermore, the runtime can be improved by other 15% to 40% using heuristic splitting of the original departure time interval to several subintervals. The algorithms we developed can be used as a precomputation step in other routing algorithms or for some travel time analysis. View Full-Text
Keywords: time-dependent shortest path problem; approximation; travel time function; road network time-dependent shortest path problem; approximation; travel time function; road network
Show Figures

Figure 1

MDPI and ACS Style

Kolovský, F.; Ježek, J.; Kolingerová, I. The ε-Approximation of the Time-Dependent Shortest Path Problem Solution for All Departure Times. ISPRS Int. J. Geo-Inf. 2019, 8, 538.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop