NETWORK DESIGN EFFECTS OF DYNAMIC TRAFFIC ASSIGNMENT

This paper examines the effects of dynamic user-equilibrium (DUE) traffic assignment with scheduled trip arrival times on network design outcomes in comparison to outcomes with steady-state travel demands. The objective is to minimize systemwide travel cost by considering alternative link improvements to an existing network (e.g., select among budget-constrained subsets of link-improvement candidates). DUE is a temporal generalization of static user-equilibrium (SUE) assignment with additional constraints to insure temporally continuous trip paths and first-in first-out (FIFO) trip ordering between all origin-destination pairs. Previous research has not investigated the effects of dynamic travel demands and schedule delay (i.e., shifts by trips to earlier or later arrival times) on network design with multiple trip origins and destinations. DUE is formulated as a bilevel program of two subproblems solved successively by an iterative algorithm that consistently converges to solutions that closely satisfy t...

[1]  Larry J. LeBlanc,et al.  CONTINUOUS EQUILIBRIUM NETWORK DESIGN MODELS , 1979 .

[2]  Bin Ran,et al.  A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models , 1993, Oper. Res..

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

[4]  Dimitri P. Bertsekas,et al.  Linear network optimization - algorithms and codes , 1991 .

[5]  André de Palma,et al.  Properties of Dynamic Traffic Equilibrium Involving Bottlenecks, Including a Paradox and Metering , 1993, Transp. Sci..

[6]  David E. Boyce,et al.  A discrete transportation network design problem with combined trip distribution and assignment , 1980 .

[7]  Larry J. LeBlanc,et al.  An Algorithm for the Discrete Network Design Problem , 1975 .

[8]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[9]  David E. Boyce,et al.  Urban Transportation Network-Equilibrium and Design Models: Recent Achievements and Future Prospects , 1984 .

[10]  Malachy Carey,et al.  Optimal Time-Varying Flows on Congested Networks , 1987, Oper. Res..

[11]  Donald W. Hearn,et al.  The gap function of a convex program , 1982, Operations Research Letters.

[12]  Bruce N Janson,et al.  DYNAMIC TRAFFIC ASSIGNMENT WITH ARRIVAL TIME COSTS. , 1993 .

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

[14]  Richard Steinberg,et al.  PREVALENCE OF BRAESS' PARADOX , 1983 .

[15]  Richard Steinberg,et al.  The Prevalence of Paradoxes in Transportation Equilibrium Problems , 1988, Transp. Sci..

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

[17]  J. Wardrop.  ROAD PAPER. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH. , 1952 .

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

[19]  Mark S. Daskin,et al.  An examination of convergence error in equilibrium traffic assignment models , 1988 .

[20]  Sam Yagar,et al.  Dynamic integrated freeway/traffic signal networks: A routing-based modelling approach , 1988 .

[21]  Frank Southworth,et al.  ESTIMATING DEPARTURE TIMES FROM TRAFFIC COUNTS USING DYNAMIC ASSIGNMENT , 1992 .

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