旅行时间
计算机科学
流量网络
运筹学
运输工程
数学优化
数学
工程类
作者
Robert M. Steinberg,Willard I. Zangwill
出处
期刊:Transportation Science
[Institute for Operations Research and the Management Sciences]
日期:1983-08-01
卷期号:17 (3): 301-318
被引量:2
标识
DOI:10.1287/trsc.17.3.301
摘要
In a noncongested transportation network where each user chooses his quickest route, the creation of an additional route between some origin-destination pair clearly cannot result in an increase in travel time to users traveling between that o-d pair. It seems reasonable to assume the same can be said of congested networks. In 1968, D. Braess presented a remarkable example demonstrating this is not the case: a new route can increase travel time for all. The present paper gives, under reasonable assumptions, necessary and sufficient conditions for “Braess' Paradox” to occur in a general transportation network. As a corollary, we obtain that Braess' Paradox is about as likely to occur as not occur.
科研通智能强力驱动
Strongly Powered by AbleSci AI