An approach to time dependence and reliability in dynamic route guidance

This paper presents a methodology, in order to increase the reliability of the route suggestions in route guidance systems. Based on the A* path finding algorithm and Chen’s link penalty method, the procedure involves penalising links with a high risk of being congested and obtaining a set of reliable route suggestions. Time-dependence of travel times is considered by adapting the Flow Speed Model technique accordingly. Modifications to the structure of the path finding algorithms are also made, so as to account for real road network features. Finally, experiments using simulated travel time and reliability data are carried out on a road network and the results are discussed

Redefining accountability in a network society

We successfully contract timetable networks with realistic transfer times. Contraction gradually removes nodes from the graph and adds shortcuts to preserve shortest paths. This reduces query times to 1ms with preprocessing times around 6 minutes on all tested instances. We achieve this by an improved contraction algorithm and by using a station graph model. Every node in our graph has a one-to-one correspondence to a station and every edge has an assigned collection of connections. Our graph model does not need parallel edges. The query algorithm does not compute a single earliest arrival time at a station but a set of arriving connections that allow best transfer opportunities.

Cost-Based Filtering for Shorter Path Constraints

Many real world problems, e.g. in personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest Path Problems with additional constraints. A well studied problem in this class is the Resource Constrained Shortest Path Problem. Reduction technique