A Modeling Framework for Passenger Assignment on a Transport Network with Timetables

This paper presents a new graph theoretic framework for the passenger assignment problem that encompasses simultaneously the departure time and the route choice. The implicit FIFO access to transit lines is taken into account by the concept of available capacity. This notion of flow priority has not been considered explicitly in previous models. A traffic equilibrium model is described and a computational procedure based on asymmetric boarding penalty functions is suggested.

[1]  D. Kinderlehrer,et al.  An introduction to variational inequalities and their applications , 1980 .

[2]  Attahiru Sule Alfa,et al.  A review of models for the temporal distribution of peak traffic demand , 1986 .

[3]  Terry L. Friesz,et al.  Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem , 1989, Oper. Res..

[4]  Stella Dafermos,et al.  Traffic Equilibrium and Variational Inequalities , 1980 .

[5]  Mike J. Smith.  The existence and calculation of traffic equilibria , 1983 .

[6]  Michael Florian,et al.  An efficient implementation of the "partan" variant of the linear approximation method for the network equilibrium problem , 1987, Networks.

[7]  Chris Hendrickson,et al.  The flexibility of departure times for work trips , 1984 .

[8]  J. A. Ventura,et al.  Restricted simplicial decomposition: computation and extensions , 1987 .

[9]  Patrice Marcotte,et al.  Hyperpath Formulations of Traffic Assignment Problems , 1998 .

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

[11]  Hani S. Mahmassani,et al.  On Boundedly Rational User Equilibrium in Transportation Systems , 1987, Transp. Sci..

[12]  D. Hearn,et al.  CONVEX PROGRAMMING FORMULATIONS OF THE ASYMMETRIC TRAFFIC ASSIGNMENT PROBLEM , 1984 .

[13]  M. Ben-Akiva,et al.  STOCHASTIC EQUILIBRIUM MODEL OF PEAK PERIOD TRAFFIC CONGESTION , 1983 .

[14]  D. Van Vliet,et al.  A Full Analytical Implementation of the PARTAN/Frank-Wolfe Algorithm for Equilibrium Assignment , 1990, Transp. Sci..

[15]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[16]  J. A. Ventura,et al.  Finiteness in restricted simplicial decomposition , 1985 .

[17]  Balder Von Hohenbalken,et al.  Simplicial decomposition in nonlinear programming algorithms , 1977, Math. Program..

[18]  S. Pallottino,et al.  Shortest Path Algorithms in Transportation models: classical and innovative aspects , 1997 .

[19]  Sang Nguyen,et al.  Solution Algorithms for Network Equilibrium Models with Asymmetric User Costs , 1982 .

[20]  Mike Smith,et al.  The existence, uniqueness and stability of traffic equilibria , 1979 .

[21]  Malachy Carey,et al.  Congested network flows: Time-varying demands and start-time policies , 1988 .

[22]  E. Polak.  Introduction to linear and nonlinear programming , 1973 .

[23]  Torbjörn Larsson,et al.  Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem , 1992, Transp. Sci..

[24]  G. Gallo,et al.  SHORTEST PATH METHODS: A UNIFYING APPROACH , 1986 .

[25]  Hubertus Franke,et al.  An Efficient Implementation of MPI , 1994 .

[26]  David E. Boyce,et al.  Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs , 1985, Transp. Sci..

[27]  Tomonori Sumi,et al.  Departure time and route choice of commuters on mass transit systems , 1990 .

[28]  Malachy Carey.  Nonconvexity of the dynamic traffic assignment problem , 1992 .

[29]  Attahiru Sule Alfa,et al.  Departure rate and route assignment of commuter traffic during peak period , 1989 .

[30]  Hani S. Mahmassani,et al.  Dynamic User Equilibrium Departure Time and Route Choice on Idealized Traffic Arterials , 1984, Transp. Sci..

[31]  Teodor Gabriel Crainic,et al.  Shortest path algorithms: A computational study with the C programming language , 1991, Comput. Oper. Res..

[32]  Gordon F. Newell.  The Morning Commute for Nonidentical Travelers , 1987, Transp. Sci..

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

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

[35]  Terry L. Friesz,et al.  A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem , 1993, Oper. Res..

[36]  Mike Smith,et al.  An algorithm for solving asymmetric equilibrium problems with a continuous cost-flow function , 1983 .