Simultaneous Departure Time/Route Choices in Queuing Networks and a Novel Paradox

In this paper, we establish an exact expression of the dynamic traffic assignment (DTA) problem with simultaneous departure time and route (SDR) choices in transportation networks with bottlenecks, where both link and path capacities are time-dependent. Using this expression, closed form of dynamic user equilibrium solutions can be obtained in some special networks. Furthermore, we investigate the DTA-SDR problem in the classical Braess’s network with closed form equilibrium solutions. The explicit results show that an inappropriately added new link could deteriorate the existing network in terms of the increase of individual and system travel costs. The mechanism of this new paradox is quite different from that of the previously discovered ones, and it is the first paradox caused by the simultaneous departure time/route competitions among individuals.

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

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

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

[4]  Michel Bierlaire,et al.  DynaMIT: a simulation-based system for traffic prediction and guidance generation , 1998 .

[5]  K. Small,et al.  The Economics Of Traffic Congestion , 1993 .

[6]  Dietrich Braess,et al.  Über ein Paradoxon aus der Verkehrsplanung , 1968, Unternehmensforschung.

[7]  Eric I. Pas,et al.  Braess' paradox: Some new insights , 1997 .

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

[9]  Takashi Akamatsu.  An Efficient Algorithm for Dynamic Traffic Equilibrium Assignment with Queues , 2001, Transp. Sci..

[10]  Takashi Akamatsu,et al.  A DYNAMIC TRAFFIC EQUILIBRIUM ASSIGNMENT PARADOX , 2000 .

[11]  Che-Fu Hsueh,et al.  A model and an algorithm for the dynamic user-optimal route choice problem , 1998 .

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

[13]  Samuel Yagar.  Dynamic traffic assignment by individual path minimization and queuing , 1971 .

[14]  Claude M. Penchina.  Braess paradox: Maximum penalty in a minimal critical network , 1997 .

[15]  Hai Yang,et al.  A capacity paradox in network design and how to avoid it , 1998 .

[16]  Hai Yang,et al.  Sensitivity analysis for the elastic-demand network equilibrium problem with applications , 1997 .

[17]  Bin Ran,et al.  A link-based variational inequality model for dynamic departure time/route choice , 1996 .

[18]  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 .

[19]  S. Yagar,et al.  ANALYSIS OF THE PEAK PERIOD TRAVEL IN A FREEWAY-ARTERIAL CORRIDOR. , 1970 .

[20]  Carlos F. Daganzo,et al.  Queue Spillovers in Transportation Networks with a Route Choice , 1998, Transp. Sci..

[21]  W. Y. Szeto,et al.  A cell-based variational inequality formulation of the dynamic user optimal assignment problem , 2002 .

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

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

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

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

[26]  V. Hurdle,et al.  THE EFFECT OF QUEUEING ON TRAFFIC ASSIGNMENT IN A SIMPLE ROAD NETWORK , 1974 .

[27]  Hai-Jun Huang,et al.  Modeling and solving the dynamic user equilibrium route and departure time choice problem in network with queues , 2002 .

[28]  Benjamin G. Heydecker,et al.  Analysis of Dynamic Traffic Equilibrium with Departure Time Choice , 2005, Transp. Sci..

[29]  Roger L. Tobin,et al.  Uniqueness and computation of an arc-based dynamic network user equilibrium formulation , 2002 .

[30]  W. Y. Szeto,et al.  A CELL-BASED SIMULTANEOUS ROUTE AND DEPARTURE TIME CHOICE MODEL WITH ELASTIC DEMAND , 2004 .

[31]  Sam Yagar,et al.  Emulation of Dynamic Equilibrium in Traffic Networks , 1976 .

[32]  B Wie,et al.  DYNAMIC SYSTEM OPTIMAL TRAFFIC ASSIGNMENT ON CONGESTED MULTIDESTINATION NETWORKS , 1990 .

[33]  B. Ran,et al.  A LINK-BASED VARIATIONAL INEQUALITY FORMULATION OF IDEAL DYNAMIC USER-OPTIMAL ROUTE CHOICE PROBLEM , 1996 .

[34]  Benjamin Heydecker,et al.  An exact expression of dynamic traffic equilibrium , 1996 .

[35]  Bruce N Janson,et al.  QUASI-CONTINUOUS DYNAMIC TRAFFIC ASSIGNMENT MODEL , 1995 .

[36]  Kenneth A. Small,et al.  THE SCHEDULING OF CONSUMER ACTIVITIES: WORK TRIPS , 1982 .