Efficient models for timetable information in public transportation systems

DOI10.1145/1227161.1227166zbMath1138.90357OpenAlexW1964915778MaRDI QIDQ3507787

Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis

Publication date: 20 June 2008

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1227161.1227166

Mathematics Subject Classification ID

Traffic problems in operations research (90B20)

Related Items (19)

Trip-Based Public Transit Routing ⋮ Heuristics for the time dependent team orienteering problem: application to tourist route planning ⋮ Unnamed Item ⋮ Engineering graph-based models for dynamic timetable information systems ⋮ Real-Time Ride-Sharing Substitution Service in Multi-modal Public Transport Using Buckets ⋮ Floyd-A algorithm solving the least-time itinerary planning problem in urban scheduled public transport network ⋮ Time-Dependent SHARC-Routing ⋮ Connection Scan Algorithm ⋮ Itinerary planning with time budget for risk-averse travelers ⋮ Non-additive shortest path in the context of traffic assignment ⋮ Time-dependent SHARC-routing ⋮ Unnamed Item ⋮ How to find good night train connections ⋮ Efficient Computation of Time-Dependent Centralities in Air Transportation Networks ⋮ Engineering Route Planning Algorithms ⋮ Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks ⋮ User-Constrained Multimodal Route Planning ⋮ Car or Public Transport—Two Worlds ⋮ Efficient Large-Scale Multi-Drone Delivery using Transit Networks

This page was built for publication: Efficient models for timetable information in public transportation systems