On paradox of transportation networks

Hsun-Jung Cho*, Yi Shan Li

*Corresponding author for this work

研究成果: Conference contribution同行評審

摘要

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.

原文English
主出版物標題Computation in Modern Science and Engineering - Proceedings of the International Conference on Computational Methods in Science and Engineering 2007 (ICCMSE 2007)
頁面1028-1031
頁數4
版本2
DOIs
出版狀態Published - 1 十二月 2007
事件International Conference on Computational Methods in Science and Engineering 2007, ICCMSE 2007 - Corfu, Greece
持續時間: 25 九月 200730 九月 2007

出版系列

名字AIP Conference Proceedings
號碼2
963
ISSN(列印)0094-243X
ISSN(電子)1551-7616

Conference

ConferenceInternational Conference on Computational Methods in Science and Engineering 2007, ICCMSE 2007
國家Greece
城市Corfu
期間25/09/0730/09/07

指紋 深入研究「On paradox of transportation networks」主題。共同形成了獨特的指紋。

引用此