Alternative paths reordering using probabilistic time-dependent routing

4Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we propose an innovative routing algorithm which takes into account stochastic properties of the road segments using the Probabilistic Time-Dependent Routing (PTDR). It can provide optimal routes for vehicles driving in a smart city based on a global view of the road network. We have implemented the algorithm in a distributed on-line service which can leverage heterogeneous resources such as Cloud or High Performance Computing (HPC) in order to serve a large number of clients simultaneously and efficiently. A preliminary experimental results using a custom traffic simulator are presented.

Cite

CITATION STYLE

APA

Golasowski, M., Beránek, J., Šurkovský, M., Rapant, L., Szturcová, D., Martinovič, J., & Slaninová, K. (2020). Alternative paths reordering using probabilistic time-dependent routing. In Advances in Intelligent Systems and Computing (Vol. 1036, pp. 235–246). Springer Verlag. https://doi.org/10.1007/978-3-030-29029-0_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free