标题: 交通路网设计问题之矛盾现象预测
The Prevalence of Braess' Paradox in Transportation Network Design Problem
作者: 李宜珊
Li, Yi-Shan
卓训荣
Cho, Hsun-Jung
运输与物流管理学系
关键字: Braess矛盾现象;路网设计;运输规划;广义反矩阵;Braess’ paradox;Network design;Transportation planning,;Generalized inverse
公开日期: 2008
摘要: Braess矛盾现象在运输规划和路网设计范畴里,皆为一重要议题且已被广泛讨论。在从事路网设计时,我们希望藉由新建道路或是提升道路容量来解决拥挤问题,但是Braess矛盾现象却显示,若没有全盘作好路网敏感性分析,例如分析需求或是路段成本函数对整个路网使用者的影响,所新建的道路可能会毫无用武之地;更甚之,使整个路网之起迄成本更高。过去学者研究中,皆以最初Braess所提出简单路网为基础,予以探究发生矛盾现象的原因,并给予建议预防。从以往的研究中,可发现Braess矛盾现象发生原因会和路网结构、路段成本函数以及起讫点需求有关。本论文以Dafermos与Nagurney于1984年提出之预测矛盾现象公式为基础,将其路网假设条件放松,其假设条件为路网中,路径数必须小于等于路段数加上起迄对数,使之模式能应用于大型路网。
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 link-OD/path matrix is full column rank , i.e., the number of paths is less than the number of links plus origin/destination pairs, Dafermos and Nagurney (Dafermos and Nagurney,1984) derived the formulas to determine whether Braess’ paradox occurs in the network. Using their formula, transportation planners could foresee occurrence of Braess’ paradox before great capital investment in road construction. This study proposes generalized inverse approach to relax the full column rank assumption presented by Dafermos and Nagurney. Then the modified model could be applied to large networks.
URI: http://140.113.39.130/cdrfb3/record/nctu/#GT079532507
http://hdl.handle.net/11536/41275
显示于类别:Thesis


文件中的档案:

  1. 250701.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.