Trip-based path algorithms using the transit network hierarchy

DOI10.1007/s11067-014-9249-3zbMath1338.90109OpenAlexW1994085259MaRDI 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 pathhyperpathnetwork hierarchypublic transit modelingschedule-based transit networktransit \(\mathrm A^*\)

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic scheduling theory in operations research (90B35) Traffic problems in operations research (90B20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Inter-school bus scheduling under stochastic travel times ⋮ Adaptive park-and-ride choice on time-dependent stochastic multimodal transportation network ⋮ Identifying critical components of a public transit system for outbreak control ⋮ Discovering the hidden community structure of public transportation networks ⋮ Itinerary planning with time budget for risk-averse travelers ⋮ Dynamic passenger assignment for major railway disruptions considering information interventions ⋮ How to optimize train stops under diverse passenger demand: a new line planning method for large-scale high-speed rail networks

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• A stochastic process approach for frequency-based transit assignment with strict capacity constraints
• Public transit corridor assignment assuming congestion due to passenger boarding and alighting
• Equilibrium traffic assignment for large scale transit networks
• A strategic model for dynamic traffic assignment
• Implicit Enumeration of Hyperpaths in a Logit Model for Transit Networks
• A Strategic Flow Model of Traffic Assignment in Static Capacitated Networks
• Transit Assignment for Congested Public Transport Systems: An Equilibrium Model
• A Modeling Framework for Passenger Assignment on a Transport Network with Timetables
• A Doubly Dynamic Schedule-based Assignment Model for Transit Networks

This page was built for publication: Trip-based path algorithms using the transit network hierarchy