Fast Exact Computation of Isochrones in Road Networks

@inproceedings{Baum2016FastEC,
  title={Fast Exact Computation of Isochrones in Road Networks},
  author={Moritz Baum and Valentin Buchhold and Julian Dibbelt and Dorothea Wagner},
  booktitle={SEA},
  year={2016}
}
We study the problem of computing isochrones in static and dynamic road networks, where the objective is to identify the boundary of the region in range from a given source within a certain amount of time. While there is a wide range of practical applications for this problemi¾źe.i¾źg., urban planning, geomarketing, visualizing the cruising range of a vehicle, there has been little research on fast algorithms for large, realistic inputs, and existing approaches tend to compute more information… 
Fast Exact Computation of Isocontours in Road Networks
TLDR
This work proposes compact but sufficient definitions of isocontours and provides several easy-to-parallelize, scalable algorithmic approaches for faster computation, and demonstrates that these techniques enable interactive isOContour computation within milliseconds even on continental networks, significantly faster than the state of the art.
Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths
TLDR
This work proposes isocontours represented by polygons with minimum number of segments that separate reachable and unreachable components of the network, and introduces several heuristics that run in (almost) linear time and are simple enough to be implemented in practice.
Computing Isochrones in Multimodal Spatial Networks using Tile Regions
TLDR
A new method to compute isochrones in multimodal spatial networks using tiles to realize chunk-loading of vertices by utilizing so-called tile regions, which significantly reduces the number of database requests, while keeping the memory usage low.
An Efficient Solution for One-To-Many Multi-Modal Journey Planning
TLDR
The one-to-many journey planning problem in multi-modal transportation networks consisting of a public transit network and an additional, non-schedule-based mode of transport is studied, based on the combination of two state-of-the-art approaches: ULTRA and (R)PHAST.
UnLimited TRAnsfers for Multi-Modal Route Planning: An Efficient Solution
TLDR
A novel preprocessing technique called ULTRA (UnLimited TRAnsfers): Given a complete transfer graph, a small number of transfer shortcuts are computed that are provably sufficient for computing all Pareto-optimal journeys, yielding the fastest known algorithms for multi-modal routing.
14 : 2 UnLimited TRAnsfers for Multi-Modal Route Planning : An Efficient Solution 1
TLDR
A novel preprocessing technique called ULTRA (UnLimited TRAnsfers): Given a complete transfer graph, a small number of transfer shortcuts are computed that are provably sufficient for computing all Pareto-optimal journeys, yielding the fastest known algorithms for multi-modal routing.
Scalable Algorithms for Bicriterion Trip-Based Transit Routing
TLDR
A One-To-Many variant of TBTR and a multilevel graph partitioning paradigm in HypTBTR and HypRAPTOR to reduce the fill-in computations are proposed and extensively tested on real-world large-scale datasets.
What to do in the Meantime: A Service Coverage Analysis for Parked Autonomous Vehicles
Abstract. Fully autonomously driving vehicles are expected to be a widely available technology in the near future. Privately owned cars, which remain parked for the majority of their lifetime, may

References

SHOWING 1-10 OF 41 REFERENCES
Scalable Computation of Isochrones with Network Expiration
TLDR
It is shown that an isochrone does not contain sufficient information to identify expired vertices, and an efficient solution is proposed that counts for each vertex the outgoing edges that have not yet been traversed, which makes the algorithm scalable for large networks and isochrones.
Scalable Isocontour Visualization in Road Networks via Minimum-Link Paths
TLDR
This work proposes polygons with minimum number of segments that separate reachable and unreachable components of the network, and introduces several heuristics that are simple enough to be implemented in practice.
Determining Objects within Isochrones in Spatial Network Databases
TLDR
This paper presents two algorithms for determining all objects that are within an isochrone, and in an empirical evaluation using real-world data they are compared with a precise yet expensive baseline algorithm.
Isochrones, traffic and DEMOgraphics
TLDR
This work utilizes live-traffic assessment results produced by Floating Car Data and their application to such crucial geomarketing test cases to provide efficient catchment area and reachability calculations.
Defining isochrones in multimodal spatial networks
TLDR
The MINE algorithm is proposed, which is independent of the actual network size and depends only on the size of the isochrone, for the computation of isochrones for multimodal spatial networks with different transportation modes that can be discrete or continuous in space and time.
ISOGA: A System for Geographical Reachability Analysis
TLDR
This paper presents a web-based system that uses isochrones to perform geographical reachability analysis and describes several application scenarios in urban and extra-urban areas, which show the applicability of the tool.
Computing Many-to-Many Shortest Paths Using Highway Hierarchies
TLDR
A fast algorithm for computing all shortest paths between source nodes s ∈ S and target nodes t ∈ T, based on highway hierarchies, which is also used for the currently fastest speedup techniques for shortest path queries in road networks.
Computing isochrones in multi-modal, schedule-based transport networks
TLDR
A solution to compute isochrones in multi-modal, schedule-based transport networks and is implemented in Java on top of the Oracle Spatial Network Model and is deployed at the Municipality of Bolzano-Bozen as a planning instrument.
Route Planning in Transportation Networks
TLDR
It is shown that one can compute driving directions in milliseconds or less even at continental scale, and a variety of techniques provide different trade-offs between preprocessing effort, space requirements, and query time.
Exact Routing in Large Road Networks Using Contraction Hierarchies
TLDR
A mobile implementation of contraction hierarchies for fast routing in road networks that also handles changes in the road network, like traffic jams, and that allows instantaneous routing without noticeable delay for the user is presented.
...
...