Detecting dynamic traffic assignment capacity paradoxes in saturated networks

Takashi Akamatsu, Benjamin Heydecker

Research output: Contribution to journalArticlepeer-review

26 Citations (Scopus)

Abstract

Creation of a new link or increase in capacity of an existing link can reduce the efficiency 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.

Original languageEnglish
Pages (from-to)123-138
Number of pages16
JournalTransportation Science
Volume37
Issue number2
DOIs
Publication statusPublished - 2003 May

ASJC Scopus subject areas

  • Civil and Structural Engineering
  • Transportation

Fingerprint Dive into the research topics of 'Detecting dynamic traffic assignment capacity paradoxes in saturated networks'. Together they form a unique fingerprint.

Cite this