Trip-based path algorithms using the transit network hierarchy
DOI10.1007/S11067-014-9249-3zbMATH Open1338.90109OpenAlexW1994085259MaRDI QIDQ298925FDOQ298925
Authors: Alireza Khani, Mark Hickman, Hyunsoo Noh 
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
Recommendations
- Finding the \(K\) shortest paths in a schedule-based transit network
- Trip-based public transit routing
- Schedule-based dynamic transit modeling. Theory and applications
- Least expected time paths in stochastic schedule-based transit networks
- A Doubly Dynamic Schedule-based Assignment Model for Transit Networks
shortest pathhyperpathnetwork hierarchypublic transit modelingschedule-based transit networktransit \(\mathrm A^*\)
Graph algorithms (graph-theoretic aspects) (05C85) Deterministic scheduling theory in operations research (90B35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Traffic problems in operations research (90B20)
Cites Work
- Network flows. Theory, algorithms, and applications.
- A note on two problems in connexion with graphs
- A stochastic process approach for frequency-based transit assignment with strict capacity constraints
- 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 Doubly Dynamic Schedule-based Assignment Model for Transit Networks
- Public transit corridor assignment assuming congestion due to passenger boarding and alighting
- Equilibrium traffic assignment for large scale transit networks
- A Modeling Framework for Passenger Assignment on a Transport Network with Timetables
Cited In (11)
- Inter-school bus scheduling under stochastic travel times
- How to optimize train stops under diverse passenger demand: a new line planning method for large-scale high-speed rail networks
- Discovering the hidden community structure of public transportation networks
- Itinerary planning with time budget for risk-averse travelers
- Computing and listing \(st\)-paths in public transportation networks
- Round-Based Public Transit Routing
- Identifying critical components of a public transit system for outbreak control
- Finding optimal hyperpaths in large transit networks with realistic headway distributions
- Dynamic passenger assignment for major railway disruptions considering information interventions
- Efficient algorithms to find optimal paths in a public transportation network
- Adaptive park-and-ride choice on time-dependent stochastic multimodal transportation network
This page was built for publication: Trip-based path algorithms using the transit network hierarchy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q298925)
