Title:	The ε-approximation of the Label Correcting Modification of the Dijkstra's Algorithm
Authors:	Kolovský, František Ježek, Jan Kolingerová, Ivana
Citation:	KOLOVSKÝ, F. JEŽEK, J. KOLINGEROVÁ, I. The ε-approximation of the Label Correcting Modification of the Dijkstra's Algorithm. In GISTAM 2019 - Proceedings of the 5th International Conference on Geographical Information Systems Theory, Applications and Management2019. Heraklion: SciTePress, 2019. s. 26-32. ISBN: 978-989-758-371-1
Issue Date:	2019
Publisher:	SciTePress
Document type:	konferenční příspěvek ConferenceObject
URI:	2-s2.0-85067445747 http://hdl.handle.net/11025/51709
ISBN:	978-989-758-371-1
Keywords in different language:	Approximation;Road Network;Time-dependent Shortest Path Problem;Travel Time Function
Abstract in different language:	This paper is focused on searching the shortest paths for all departure times (profile search). This problem is called a time-dependent shortest path problem (TDSP) and is important for optimization in transportation. Particularly this paper deals with the ε-approximation of TDSP. The proposed algorithm is 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 95% of breakpoints and 80% time compared to the exact version of LCA. A more efficient precomputation step for another time-dependent routing algorithms can be built using the developed algorithm.
Rights:	© Scitepress
Appears in Collections:	Konferenční příspěvky / Conference Papers (KGM) OBD

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.