A schedule-based dynamic transit network model - Recent advances and prospective future research

Using the schedule-based approach, in which scheduled timetables are used to describe the movement of vehicles, a dynamic transit assignment model is formulated. Passengers are assumed to travel on a path with minimum generalized cost that consists of four components: in-vehicle time; waiting time; walking time; and a time penalty for each line change. A specially developed branch and bound algorithm is used to generate the time-dependent minimum path. The assignment procedure is conducted over a period in which both passenger demand and train headway are varying. This paper presents an overview of the research that has been carried out by the authors to develop the schedule-based transit assignment model, and offers perspectives for future research.

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

[2]  Hai Yang,et al.  Estimation of origin-destination matrices from link traffic counts on congested networks , 1992 .

[3]  P. Robillard,et al.  Common Bus Lines , 1975 .

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

[5]  Michael Florian,et al.  Optimal strategies and optimal routes in public transit assignment models: an empirical comparison , 1987 .

[6]  E. Cascetta.  Estimation of trip matrices from traffic counts and survey data: A generalized least squares estimator , 1984 .

[7]  H. Spiess.  A MAXIMUM LIKELIHOOD MODEL FOR ESTIMATING ORIGIN-DESTINATION MATRICES , 1987 .

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

[9]  Henk J van Zuylen,et al.  The most likely trip matrix estimated from traffic counts , 1980 .

[10]  Jia Hao Wu,et al.  Transit Equilibrium Assignment: A Model and Solution Algorithms , 1994, Transp. Sci..

[11]  Robert B. Dial,et al.  A PROBABILISTIC MULTIPATH TRAFFIC ASSIGNMENT MODEL WHICH OBVIATES PATH ENUMERATION. IN: THE AUTOMOBILE , 1971 .

[12]  M. Bell.  THE ESTIMATION OF ORIGIN-DESTINATION MATRICES BY CONSTRAINED GENERALISED LEAST SQUARES , 1991 .

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

[14]  Hai Yang,et al.  The equilibrium-based origin-destination matrix estimation problem , 1994 .

[15]  Michael G.H. Bell,et al.  The Estimation of an Origin-Destination Matrix from Traffic Counts , 1983 .

[16]  Shing Chung Josh Wong,et al.  A stochastic transit assignment model using a dynamic schedule-based network , 1999 .

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

[18]  S E Keak.  TRANSEPT: A BUS MODEL , 1976 .

[19]  Federico Malucelli,et al.  Regional mass transit assignment with resource constraints , 1996 .

[20]  Shing Chung Josh Wong,et al.  A schedule-based time-dependent trip assignment model for transit networks , 1999 .

[21]  J D Cea Ch.  TRANSIT ASSIGNMENT TO MINIMAL ROUTES: AN EFICIENT NEW ALGORITHM , 1989 .

[22]  Shing Chung Josh Wong,et al.  Estimation of time-dependent origin–destination matrices for transit networks , 1998 .

[23]  J D Cea,et al.  TRANSIT ASSIGNMENT TO MINIMAL ROUTES: AN EFFICIENT NEW ALGORITHM , 1989 .

[24]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[25]  Ennio Cascetta,et al.  Dynamic Estimators of Origin-Destination Matrices Using Traffic Counts , 1993, Transp. Sci..