Alternative paths reordering using probabilistic time-dependent routing
Advances in Networked-based Information Systems: The 22nd International …, 2020•Springer
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 …
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 …
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.
Springer
Showing the best result for this search. See all results