On paradox of transportation networks

Hsun-Jung Cho*, Yi Shan Li

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


In transportation planning and network design, Braess paradox problem has been discussed for many decades. Those researches were originated from the simple network illustrated by Braess. Many works devoted to seek efficient methods to avoid the occurrence of paradox problem or find some rules for network designers to refer. Under arc-OD/path matrix is full column rank assumption i.e., the number of paths is less than the number of arcs plus origin/destination pairs, Dafermos and Nagurney derived the formulas to determine, whether Braess' paradox occurs in the network. In the large transportation networks, the number of path is larger than the number of arc, so their assumption is violated. The main purpose of this paper is to conquer the small network restriction. The generalized inverse method is used to relax the assumption presented by Dafermos and Nagurney.

Original languageEnglish
Title of host publicationComputation in Modern Science and Engineering - Proceedings of the International Conference on Computational Methods in Science and Engineering 2007 (ICCMSE 2007)
Number of pages4
StatePublished - 1 Dec 2007
EventInternational Conference on Computational Methods in Science and Engineering 2007, ICCMSE 2007 - Corfu, Greece
Duration: 25 Sep 200730 Sep 2007

Publication series

NameAIP Conference Proceedings
ISSN (Print)0094-243X
ISSN (Electronic)1551-7616


ConferenceInternational Conference on Computational Methods in Science and Engineering 2007, ICCMSE 2007


  • Braess's paradox
  • Generalized inverse
  • Network design
  • Transportation planning

Fingerprint Dive into the research topics of 'On paradox of transportation networks'. Together they form a unique fingerprint.

Cite this