SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Minimum Path Algorithms for a Schedule-Based Transit Network with a General Fare Structure
5 references·0 citing·25 second hop
Minimum Path Algorithms for a Schedule-Based Transit Network with a General Fare Structure (2004)Minimum Path Algorithms for a Schedule-Ba…A Modeling Framework for Passenger Assignment on a Transport Network with Timetables (2001)A Modeling Framework for Pass…A Doubly Dynamic Schedule-based Assignment Model for Transit Networks (2001)A Doubly Dynamic Schedule-bas…A stochastic transit assignment model using a dynamic schedule-based network (1999)A stochastic transit assignme…Regional mass transit assignment with resource constraints (1996)Regional mass transit assignm…A computer model for finding the time‐dependent minimum path in a transit system with fixed schedules (1984)A computer model for finding …A probabilistic multipath traffic assignment model which obviates path enumeration (1971)An extended model and procedural framework for planning multi-modal passenger journeys (2003)Procedures for planning multi-leg journeys with fixed-route and demand-responsive passenger transport services (2004)Finding the K shortest paths in a schedule-based transit network (2010)Dynamic User Equilibrium Departure Time and Route Choice on Idealized Traffic Arterials (1984)Transportation planning models (1984)Equilibrium traffic assignment for large scale transit networks (1988)Schedule-Based Transit Assignment Models (2002)Schedule-based transit assignment: new dynamic equilibrium model with vehicle capacity constraints (2008)Large-scale application of MILATRAS: case study of the Toronto transit network (2011)Common Bus Lines (1975)Optimal strategies: A new assignment model for transit networks (1989)Transit Users’ Route‐Choice Modelling in Transit Assignment: A Review (2010)A schedule-based assignment model with explicit capacity constraints for congested transit networks (2011)Schedule-based transit assignment model with vehicle capacity and seat availability (2011)The existence, uniqueness and stability of traffic equilibria (1979)Traffic Equilibrium and Variational Inequalities (1980)The Traffic Assignment Problem: Models and Methods (1994)Effect of Real-Time Transit Information on Dynamic Path Choice of Passengers (2011)Capacitated transit service network design with boundedly rational agents (2016)Recursive Methods in Economic Dynamics (1989)Transit Assignment for Congested Public Transport Systems: An Equilibrium Model (1993)A dynamic schedule-based model for congested transit networks (2003)Chapter 2 Public Transit (2006)Schedule-based transit assignment model with travel strategies and capacity constraints (2008)
this work references cited by second hop

References

  • 2001A Doubly Dynamic Schedule-based Assignment Model for Transit Networks207 cited
  • 1999A stochastic transit assignment model using a dynamic schedule-based network149 cited
  • 2001A Modeling Framework for Passenger Assignment on a Transport Network with Timetables122 cited
  • 1984A computer model for finding the time‐dependent minimum path in a transit system with fixed schedules76 cited
  • 1996Regional mass transit assignment with resource constraints27 cited

Cited by

No citing works inside the corpus for this window.

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work