A DYNAMIC TRAFFIC ASSIGNMENT MODEL WITH TRAFFIC-FLOW RELATIONSHIPS

Abstract Conventional traffic assignment methods assume that the origin-destination (OD) demand is uniformly distributed over time to estimate the traffic pattern. This assumption does not hold for modeling peak periods of congestion in which the OD demand is time varying. In this paper, we present a dynamic traffic assignment model with traffic-flow relationships based on a bi-level optimization framework. Our assignment variable is the number of vehicles present on a link during a time step, rather than traffic flow, which is used in static assignment. Using the modified Greenshields speed-density relationship, we derive a link-cost function that is monotonically nondecreasing and convex with respect to density. To capture traffic dynamics, we use short time-steps. The model prevents violations of the first-in-first-out (FIFO) condition using constraints on the distances moved by vehicles during each time step. A solution algorithm which resembles a Stackelberg leader-follower problem is presented, and numerical results from networks of different sizes demonstrate that the proposed model performs satisfactorily.

[1]  André de Palma,et al.  Some Circumstances in Which Vehicles Will Reach Their Destinations Earlier by Starting Later: Revisited , 1986, Transp. Sci..

[2]  Hani S. Mahmassani,et al.  IN-VEHICLE INFORMATION SYSTEMS FOR NETWORK TRAFFIC CONTROL: A SIMULATION FRAMEWORK TO STUDY ALTERNATIVE GUIDANCE STRATEGIES , 1992 .

[3]  Hani S. Mahmassani,et al.  An evaluation tool for advanced traffic information and management systems in urban networks , 1994 .

[4]  Sang Nguyen,et al.  A dual simplex algorithm for finding all shortest paths , 1981, Networks.

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

[6]  C. Chen,et al.  Stackelburg solution for two-person games with biased information patterns , 1972 .

[7]  David E. Boyce,et al.  A bilevel programming algorithm for exact solution of the network design problem with user-optimal flows , 1986 .

[8]  C. Daganzo.  On the traffic assignment problem with flow dependent costs—II , 1977 .

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

[10]  Mike Smith,et al.  A new dynamic traffic model and the existence and calculation of dynamic user equilibria on congested capacity-constrained road networks , 1993 .

[11]  Deepak K. Merchant,et al.  A Model and an Algorithm for the Dynamic Traffic Assignment Problems , 1978 .

[12]  Bruce N Janson,et al.  Dynamic traffic assignment for urban road networks , 1991 .

[13]  Carlos F. Daganzo,et al.  The Spatial Evolution of Queues During the Morning Commute in a Single Corridor , 1993 .

[14]  George L. Nemhauser,et al.  Optimality Conditions for a Dynamic Traffic Assignment Model , 1978 .

[15]  R. Jayakrishnan,et al.  A FASTER PATH-BASED ALGORITHM FOR TRAFFIC ASSIGNMENT , 1994 .

[16]  Bin Ran,et al.  DYNAMIC TRANSPORTATION NETWORK MODELS FOR ADVANCED TRAVELER INFORMATION SYSTEMS , 1993 .

[17]  Jonathan F. Bard,et al.  The Mixed Integer Linear Bilevel Programming Problem , 1990, Oper. Res..

[18]  Malachy Carey,et al.  A Constraint Qualification for a Dynamic Traffic Assignment Model , 1986, Transp. Sci..