Trip-based path algorithms using the transit network hierarchy

DOI10.1007/s11067-014-9249-3zbMath1338.90109MaRDI QIDQ298925

F. Blanchet-Sadri, M. Dambrine

Publication date: 21 June 2016

Published in: Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11067-014-9249-3

zbMATH Keywords

shortest path; hyperpath; network hierarchy; public transit modeling; schedule-based transit network; transit \(\mathrm A^*\)

Mathematics Subject Classification ID

05C82: Small world graphs, complex networks (graph-theoretic aspects)

90B35: Deterministic scheduling theory in operations research

90B20: Traffic problems in operations research

05C85: Graph algorithms (graph-theoretic aspects)