Engineering graph-based models for dynamic timetable information systems

DOI10.1016/J.JDA.2017.09.001MaRDI QIDQ1679616zbMATH OpenOpenAlexFDO

Authors Alessio Cionini, Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Kalliopi Giannakopoulou, Andreas Paraskevopoulos, Christos Zaroliagis

Publication date 9 November 2017

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2014/4752/

zbMATH Keywords

shortest pathsexperimental evaluationdynamic updatesjourney planningpublic transportation systemstimetable models

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Search theory (90B40) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)

Recommendations

• Engineering graph-based models for dynamic timetable information systems
• Efficient Timetable Information in the Presence of Delays
• Efficient models for timetable information in public transportation systems
• Engineering time-expanded graphs for faster timetable information
• Engineering Time-Expanded Graphs for Faster Timetable Information

Cites work

• scientific article; zbMATH DE number 7121837 (Why is no real title available?)
• A new dynamic graph structure for large-scale transportation networks
• Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm
• Computing delay resistant railway timetables
• Computing the shortest path: \(A^\ast\) search meets graph theory
• Delay Management Problem: Complexity Results and Robust Algorithms
• Delay-robustness of transfer patterns in public transportation route planning
• Dynamic multi-level overlay graphs for shortest paths
• Efficient Timetable Information in the Presence of Delays
• Efficient models for timetable information in public transportation systems
• Engineering Time-Expanded Graphs for Faster Timetable Information
• Fast routing in very large public transportation networks using transfer patterns
• Fully dynamic update of arc-flags
• Geometric containers for efficient shortest-path computation
• Intriguingly simple and fast transit routing
• Is timetabling routing always reliable for public transport?
• Recoverable Robustness in Shunting and Timetabling
• Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
• Round-Based Public Transit Routing
• Trip-based public transit routing

Cited in

(6)

• Engineering Time-Expanded Graphs for Faster Timetable Information
• Routing in multimodal transportation networks with non-scheduled lines
• Fully Dynamic 2-Hop Cover Labeling
• 15. Maintenance of multi-level overlay graphs for timetable queries
• Efficient models for timetable information in public transportation systems
• Trip-based public transit routing

This page was built for publication: Engineering graph-based models for dynamic timetable information systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1679616)