Route Planning in Transportation Networks

@inproceedings{Bast2016RoutePI,
  title={Route Planning in Transportation Networks},
  author={Hannah Bast and Daniel Delling and Andrew V. Goldberg and Matthias M{\"u}ller-Hannemann and Thomas Pajor and Peter Sanders and Dorothea Wagner and Renato F. Werneck},
  booktitle={Algorithm Engineering},
  year={2016}
}
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 at continental scale. A variety of techniques provide different trade-offs between preprocessing effort, space requirements, and query time. Some algorithms can answer queries in a fraction of a microsecond, while others can deal efficiently with real-time traffic. Journey planning on public transportation systems… 
MUSE: Multimodal Separators for Efficient Route Planning in Transportation Networks
TLDR
A new multimodal algorithm based on graph separators to compute shortest travel time paths, MUSE, which partitions the network into independent, smaller regions, enabling fast and scalable preprocessing and augmenting the algorithm with heuristics during the query phase to achieve further speedups.
Journey Planning Algorithms for Massive Delay-Prone Transit Networks
TLDR
A new framework is introduced that extends ptl to function in delay-prone transit networks by providing a new set of algorithms able to update both the graph and the precomputed labeling whenever a delay affects the network, without performing any recomputation from scratch.
A Fast and Tight Heuristic for A* in Road Networks
TLDR
An algorithm to efficiently extract distance estimates for A* from Contraction Hierarchies (CH), a hierarchical technique called CH-Potentials, which allows decoupling the supported extensions from the hierarchical speedup technique.
Real-Time Traffic Assignment Using Fast Queries in Customizable Contraction Hierarchies
TLDR
This paper significantly accelerate the computation of flow patterns, enabling interactive transportation and urban planning applications and revisiting and carefully engineering known speedup techniques for shortest paths, and combining them with customizable contraction hierarchies.
Better transit routing by exploiting vehicle GPS data
TLDR
The main findings of the experiments are that GSP data provides substantial benefits for short journeys, while it does not seem to provide enough insight to improve long journeys and new routing algorithms are provided and evaluated to improve the reliability of public transport journey planners.
Advanced modeling approach for computing multicriteria shortest paths in multimodal transportation networks
  • O. Dib, M. Manier, L. Moalic
  • Computer Science
    2016 IEEE International Conference on Intelligent Transportation Engineering (ICITE)
  • 2016
TLDR
A routing algorithm to compute the entire set of nondominated solutions to go from one place to another and indicates that the proposed approach is efficient enough to be integrated within a real world journey-planning system.
DEPART: Dynamic Route Planning in Stochastic Time-Dependent Public Transit Networks
TLDR
By leveraging a large set of historical travel smart card data, a method to build a stochastic time-dependent model for public transit networks is proposed and DEPART -- a dynamic route planner is developed that takes the Stochastic models of both bus travel time and waiting time into account and optimizes both the speediness and reliability of routes.
Exploiting GPS Data in Public Transport Journey Planners
TLDR
This work considers the public transport network of the metropolitan area of Rome, where delays are not rare events, and reports the results of the experiments with two journey planners that are widely used for this city: one based on timetabling information only (Google Transit) and one which makes explicit use of GPS data on the geo-location of transit vehicles (Muovi Roma).
Time-Dependent Route Planning for Truck Drivers
TLDR
This work introduces the truck driver routing problem in time-dependent road networks and greatly reduces (empirical) running times by calculating bounds on arrival and departure times during additional search phases to only query partial profiles and only to a fraction of the parking lots.
Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies
TLDR
This article significantly accelerate the computation of flow patterns, enabling interactive transportation and urban planning applications by building a traffic assignment procedure upon customizable contraction hierarchies (CCH), revisiting and carefully engineering CCH customization and queries, and adapting CCH to compute batched point-to-point shortest paths.
...
...

References

SHOWING 1-10 OF 306 REFERENCES
Route Planning in Road Networks
TLDR
This book addresses students, researchers, and software developers that are interested in car navigation systems, route planning services, logistics, or any other application where route planning in road networks plays a crucial role.
Accelerating Multi-modal Route Planning by Access-Nodes
TLDR
This work presents a first efficient solution to a restricted variant of the shortest path problem including experimental results for transportation networks with up to 125 Mio.
Customizable Route Planning in Road Networks (Extended Abstract)
TLDR
This work presents a practical algorithm that has no such drawbacks, and can compute shortest paths on continental road networks with arbitrary metrics (cost functions), and is ideal for a real-world routing engine, and is indeed in use by Bing Maps.
Parallel computation of best connections in public transportation networks
TLDR
This work presents a novel algorithm that answers the question for all fastest connections between a given station S and any other station at any time of the day in a single query, and introduces the connection-setting property, which allows for a very natural parallelization, yielding excellent speed-ups on standard multi-core servers.
Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns
TLDR
This work shows how to route on very large public transportation networks (up to half a billion arcs) with average query times of a few milliseconds, based on two key observations: many shortest paths share the same transfer pattern and direct connections without change of vehicle can be looked up quickly.
Time-Dependent Route Planning with Generalized Objective Functions
TLDR
A generalization of time-dependent contraction hierarchies to the problem of finding routes in road networks that optimize a combination of travel time and additional time-invariant costs yields approximations with negligible errors which makes the model feasible for high-throughput web services.
Is Timetabling Routing Always Reliable for Public Transport?
TLDR
The time estimates required for trips provided by a timetabling-based route planner are taken and compared against the times taken by the trips according to the actual tracking of transit vehicles in the transport network, measured through the GPS data made available by the transit agency.
Better transit routing by exploiting vehicle GPS data
TLDR
The main findings of the experiments are that GSP data provides substantial benefits for short journeys, while it does not seem to provide enough insight to improve long journeys and new routing algorithms are provided and evaluated to improve the reliability of public transport journey planners.
Exploiting GPS Data in Public Transport Journey Planners
TLDR
This work considers the public transport network of the metropolitan area of Rome, where delays are not rare events, and reports the results of the experiments with two journey planners that are widely used for this city: one based on timetabling information only (Google Transit) and one which makes explicit use of GPS data on the geo-location of transit vehicles (Muovi Roma).
Frequency-based search for public transit
TLDR
A new version of Dijkstra's algorithm that works with frequency-based labels and is suitable for profile queries is designed, and Transfer Patterns, a state-of-the-art technique for fully realistic route planning in large public-transportation networks is improved.
...
...