Verifying Geostatistical Travel Time Properties on Routing Networks

@inproceedings{Landtsheer2016VerifyingGT,
  title={Verifying Geostatistical Travel Time Properties on Routing Networks},
  author={Renaud De Landtsheer and Christophe Ponsard},
  booktitle={ICORES},
  year={2016}
}
Nowadays, many systems are increasingly relying on interconnected, geolocated, and mobile devices. In order to cope with this, geographical information system (GIS) have evolved to precisely capture not only the spatial characteristics of real world transportation networks but also temporal dimension, including the variability of travel duration related to traffic jams. This paper explores the verification of a number of interesting spatiotemporal properties identified from a set of real world… 

Figures and Tables from this paper

Towards Modelling and Analysis of Spatial and Temporal Requirements

TLDR
This work discusses the current progress on the design of a coherent set of notations borrowed from both fields to enrich domain and goal models with spatial and temporal properties, and sketches how specific methodological support can be provided on top of them to achieve high quality requirements.

References

SHOWING 1-10 OF 17 REFERENCES

Distributed Time-Dependent Contraction Hierarchies

TLDR
This work gives a distributed memory parallelization of the arguably best current technique – time-dependent contraction hierarchies, and removes bottlenecks in server based route planning in road networks.

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.

Time-Dependent Contraction Hierarchies and Approximation

TLDR
Time-dependent Contraction Hierarchies provide fast and exact route planning for time-dependent large scale road networks but need lots of space so the careful use of approximations of piecewise linear functions is needed to solve this problem.

Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks

TLDR
CHs can be combined with many other route planning techniques, leading to improved performance for many-to-many routing, transit-node routing, goal-directed routing or mobile and dynamic scenarios, and a hierarchical query algorithm using bidirectional shortest-path search is obtained.

Efficient Routing in Road Networks with Turn Costs

TLDR
An efficient algorithm for shortest path computation in road networks with turn costs with augmented node contraction allows fast shortest path queries and reduces preprocessing time and space by a factor of 3.4 without change in query time.

A review of travel-time prediction in transport and logistica

Travel-time information could be applied in various fields and purposes. From the travellers' viewpoints, the travel-time information helps to save travel-time and improve reliability through the

Time-Dependent Contraction Hierarchies

TLDR
This is the first hierarchical speedup technique for time-dependent routing that allows bidirectional query algorithms and outperforms previous techniques with respect to query time using comparable or lower preprocessing time.

Distance Oracles for Time-Dependent Networks

We present the first approximate distance oracle for sparse directed networks with time-dependent arc-travel-times determined by continuous, piecewise linear, positive functions possessing the FIFO

Validation of travel times to hospital estimated by GIS

TLDR
GIS estimates of car travel times were moderately close approximations to reported times, suggesting that GIS travel time estimates may be superior to reported travel times for modelling purposes because reported times contain errors and can reflect unusual circumstances.

A Formal Basis for the Heuristic Determination of Minimum Cost Paths

TLDR
How heuristic information from the problem domain can be incorporated into a formal mathematical theory of graph searching is described and an optimality property of a class of search strategies is demonstrated.