We survey recent advances in algorithms for route planning in transportation networks. For
road networks, we show that one can compute driving directions in milliseconds or less even …

We propose the first routing engine for computing driving directions in large-scale road
networks that satisfies all requirements of a real-world production system. It supports …

We investigate the gap between theory and practice for exact branching algorithms. In
theory, branch-and-reduce algorithms currently have the best time complexity for numerous …

Ridesharing enables drivers to share any empty seats in their vehicles with riders to improve
the efficiency of transportation for the benefit of both drivers and riders. Different from …

In a constrained shortest path (CSP) query, each edge in the road network is associated with
both a length and a cost. Given an origin s, a destination t, and a cost constraint θ, the goal is …

As a well-known NP-hard problem, the vertex cover problem has broad applications, which
has aroused the concern of many researchers. In recent years, its related optimization …

All current navigation systems return efficient source-to-destination routes assuming a" one-
size-fits-all" set of objectives, without addressing most personal preferences. Although they …

Nowadays, ridesharing becomes a popular commuting mode. Dynamically arriving riders
post their origins and destinations, then the platform assigns drivers to serve them. In …

Computing shortest paths in road networks with millions of nodes and edges is challenging
on its own. In the last few years, several preprocessing-based acceleration techniques have …

Compared to conventional cars, electric vehicles (EVs) still suffer from considerably shorter
cruising ranges. Combined with the sparsity of battery loading stations, the complete …