Computing the shortest path between two vertices is a fundamental problem in road
networks that is applied in a wide variety of applications. To support efficient shortest path …

We study the problem of quickly computing point-to-point shortest paths in massive road
networks with traffic predictions. Incorporating traffic predictions into routing allows, for …

Algorithms for computing driving directions on road networks often presume constant costs
on each arc. In practice, the current traffic situation significantly influences the travel time …

We study the earliest arrival and profile problems in road networks with time-dependent
functions as arc weights and dynamic updates. We present and experimentally evaluate …

A novel landmark-based oracle (CFLAT) is presented, which provides earliest-arrival-time
route plans in time-dependent road networks. To our knowledge, this is the first oracle that …

We study how to compute routes that avoid traffic in road networks. Imperfections in real-time
traffic feeds may yield routes with undesirable detours through parking lots or residential …

Finding the fastest route through traffic, a well-rated restaurant enroute while traveling, the
latest train to catch in order to arrive on-time, or a decently priced apartment, with a well …

Computing shortest paths in networks that exhibit a time-dependent metric is a core routine
for many applications, with route planning in road networks being a prime example. In this …

Providing efficient, sustainable and personalized mobility services in urban environments
that combine a spectrum of transport modes (eg, public transport, electric vehicles, vehicle …

We study the earliest arrival problem in road networks with static time-dependent functions
as arc weights. We propose and evaluate the following simple algorithm:(1) average the …