A Solution to the Transit Assignment Problem

This paper describes a capacity constrained frequency- or headway-based transit assignment model which, by relaxing the assumption of flow conservation, can consider within-day dynamics. The probability of failing to board a service due to insufficient capacity is taken into account in route choice. Passengers mingle on platforms, so that the probability of failing to board a service is not a function of origin, destination or time of arrival at the platform. The presence of common lines is not taken into account. An example demonstrates the impact of the capacity constraint on the number of passengers boarding at each stop when passengers make risk-averse route choices.

[1]  Y Iida,et al.  Transportation Network Analysis , 1997 .

[2]  Stefano Pallottino,et al.  Equilibrium traffic assignment for large scale transit networks , 1988 .

[3]  Shing Chung Josh Wong,et al.  On the convergence of Bell's logit assignment formulation , 1999 .

[4]  Michael G.H. Bell,et al.  Transportation Network Analysis: Bell/Transportation Network Analysis , 1997 .

[5]  Michael Florian,et al.  Optimal strategies: A new assignment model for transit networks , 1989 .

[6]  F P Clerq.  A PUBLIC TRANSPORT ASSIGNMENT METHOD , 1972 .

[7]  Hai Yang,et al.  A stochastic user equilibrium assignment model for congested transit networks , 1999 .

[8]  M. Bell.  Alternatives to Dial's logit assignment algorithm , 1995 .

[9]  Shing Chung Josh Wong,et al.  A dynamic schedule-based model for congested transit networks , 2004 .

[10]  José R. Correa,et al.  Common-Lines and Passenger Assignment in Congested Transit Networks , 2001, Transp. Sci..

[11]  Shing Chung Josh Wong,et al.  A schedule-based dynamic transit network model - Recent advances and prospective future research , 2001 .

[12]  Takashi Akamatsu,et al.  Cyclic flows, Markov process and stochastic traffic assignment , 1996 .

[13]  E. Cascetta,et al.  A MODIFIED LOGIT ROUTE CHOICE MODEL OVERCOMING PATH OVERLAPPING PROBLEMS. SPECIFICATION AND SOME CALIBRATION RESULTS FOR INTERURBAN NETWORKS , 1996 .

[14]  C. O. Tong,et al.  A computer model for finding the time-dependent minimum path in a transit system with fixed schedules , 1984 .

[15]  H. D. Miller,et al.  The Theory Of Stochastic Processes , 1977, The Mathematical Gazette.

[16]  Enrique Fernández,et al.  Transit Assignment for Congested Public Transport Systems: An Equilibrium Model , 1993, Transp. Sci..