This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via Google Scholar Google Scholar Articles by Akamatsu, T. Articles by Heydecker, B. Search for Related Content

Detecting Dynamic Traffic Assignment Capacity Paradoxes in Saturated Networks

Graduate School of Information Sciences, Tohoku University, Aoba, Sendai, Miyagi 980–8579, Japan
Centre for Transport Studies, University College London, Gower Street, London, WC1E 6BT, England
akamatsu{at}plan.civil.tohoku.ac.jp
ben{at}transport.ucl.ac.uk

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.

History: Received: October 2000; revised: September 2001; accepted: January 2002.