TITLE

Detecting Dynamic Traffic Assignment Capacity Paradoxes in Saturated Networks

AUTHOR(S)
Akamatsu, Takashi; Heydecker, Benjamin
PUB. DATE
May 2003
SOURCE
Transportation Science;May2003, Vol. 37 Issue 2, p123
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Creation of a new link or increase in capacity of an existing link can reduce the efficiency of a congested network as measured by the total travel cost. This phenomenon, of which an extreme example is given by Braess paradox, has been examined in conventional studies within the framework of static assignment. For dynamic traffic assignment, which makes account of the effect of congestion through explicit representation of queues, Akamatsu (2000) gave a simple example of the occurrence of this paradox. The present paper extends that result to a more general network. We first present a necessary and sufficient condition for the paradox to occur in a general network in which there is a queue on each link. We then give a graph-theoretic interpretation of the condition, which gives us a convenient method to test whether or not the paradox will occur by performing certain tests on information that describes the network structure. Finally, as an application of this theory, we examine several example networks and queueing patterns where occurrence of this paradox is inevitable.
ACCESSION #
9909021

 

Related Articles

  • Simultaneous Departure Time/Route Choices in Queuing Networks and a Novel Paradox. Xiaoning Zhang; Zhang, H. M. // Networks & Spatial Economics;Mar2010, Vol. 10 Issue 1, p93 

    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...

  • A Network Design Algorithm Using a Stochastic Incremental Traffic Assignment Approach. Mingyuan Chen; Alfa, Attahiru Sule // Transportation Science;Aug91, Vol. 25 Issue 3, p215 

    In this paper, a branch and bound algorithm is presented for solving network design problems (NDP). Route selection for the NDP is based on a stochastic incremental traffic assignment approach. Experiments are performed to compare the behaviors of three assignment methods. Numerical examples are...

  • A Variable Trip Time Model for Cyclic Railway Timetabling. Kroon, Leo G.; Peeters, Leon W.P. // Transportation Science;May2003, Vol. 37 Issue 2, p198 

    In this paper we describe how variable trip times can be included into an existing cyclic railway timetabling model based on the well-known periodic event scheduling problem (PESP). Thereby we provide an extension of the existing model because in the existing model it is assumed that the trip...

  • Comparative analysis of transit assignment: evidence from urban railway system in the Tokyo Metropolitan Area. Kato, Hironori; Kaneko, Yuichiro; Inoue, Masashi // Transportation;Sep2010, Vol. 37 Issue 5, p775 

    This paper empirically compares the performance of six traffic assignment methods using the same empirical dataset of route choice. Multinomial logit (MNL), structured multinomial probit (SMNP), user equilibrium (UE), logit-based stochastic user equilibrium (SUE), probit-based SUE, and...

  • A Strategic Flow Model of Traffic Assignment in Static Capacitated Networks. Marcotte, Patrice; Nguyen, Sang; Schoeb, Alexandre // Operations Research;Mar/Apr2004, Vol. 52 Issue 2, p191 

    This work pleads for the use of the concept of strategies, and their network-theoretic representation as hyperpaths, for modeling network assignment problems. While this concept describes adequately the behavior of users in transit systems, we show that it can apply as well to networks where arc...

  • Alternative Conditions for a Well-Behaved Travel Time Model. Carey, Malachy; Ge, Y. E. // Transportation Science;Aug2005, Vol. 39 Issue 3, p417 

    The travel time Τ(t) on a link has often been treated in dynamic traffic assignment (DTA) as a function of the number of vehicles x(t) on the link, that is, Τ(t) =f(x(t)). In earlier papers, bounds on the gradient of this travel time function f(x) have been introduced to ensure that the...

  • Estimating Freight Flows for Metropolitan Area Highway Networks Using Secondary Data Sources. Giuliano, Genevieve; Gordon, Peter; Qisheng Pan; JiYoung Park; LanLan Wang // Networks & Spatial Economics;Mar2010, Vol. 10 Issue 1, p73 

    We present a method for estimating intra-metropolitan freight flows on a highway network. The work is part of a larger project aimed at developing an automated, integrated system for freight flow analysis and planning. To overcome the limitations of current estimation methods for commodity...

  • Traffic Speed Time Series Short Term Forecasting Using Aggregated Model. Jian Gu; Shuyan Chen // Applied Mechanics & Materials;2014, Issue 587-589, p2057 

    This paper integrated superiority from time series model and least square support vector machine regression model with data aggregation for traffic speed short term forecasting. Based on the results of traffic data variations analysis, the practicability that speed data can be aggregated to...

  • A Mixed Traffic Assignment Problem and Its Upper Bound of Efficiency Loss. Xiao-Jun Yu; Jiancheng Long // Journal of Applied Mathematics;2014, p1 

    A variational inequality (VI) formulation of a mixed traffic assignment problem associated with user equilibrium (UE) player and altruistic players (UE-AP) is developed. The users governed by the UE player use the paths with minimum actual travel cost, while the users governed by altruistic...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics