Finding optimal hyperpaths in large transit networks with realistic headway distributions
From MaRDI portal
Publication:2629602
Recommendations
- The planning of headways in urban public transit
- Stochastic assignment to high frequency transit networks: Models, algorithms, and applications with different perceived cost distributions
- Trip-based path algorithms using the transit network hierarchy
- Least expected time paths in stochastic schedule-based transit networks
- Optimization of transit route network, vehicle headways and timetables for large-scale transit networks
Cites work
- A stochastic process approach for frequency-based transit assignment with strict capacity constraints
- Capacitated transit assignment with loading priorities.
- Capacity constrained transit assignment with common lines
- Common-Lines and Passenger Assignment in Congested Transit Networks
- Equilibrium traffic assignment for large scale transit networks
- scientific article; zbMATH DE number 1324132 (Why is no real title available?)
- Hypernetworks in a directed hypergraph
- Implicit enumeration of hyperpaths in a logit model for transit networks
- Modeling Bus Stops in Transit Networks: A Survey and New Formulations
- Transit Assignment for Congested Public Transport Systems: An Equilibrium Model
- Transit Equilibrium Assignment: A Model and Solution Algorithms
Cited in
(4)- Itinerary planning with time budget for risk-averse travelers
- Least expected time paths in stochastic schedule-based transit networks
- Reliability in public transit networks considering backup itineraries
- On probability distributions of the time deviation law of container liner ships under interference uncertainty
This page was built for publication: Finding optimal hyperpaths in large transit networks with realistic headway distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2629602)