The negation of the Braess paradox as demand increases: The wisdom of crowds in transportation networks
نویسنده
چکیده
In the well-known Braess paradox [D. Braess, Unternehmenforschung 12, 258 (1968)], the addition of a new route in a specific congested transportation network made all the travelers worse off in terms of their individual travel cost (time). In this paper, we consider the hypothesis that, in congested networks, the Braess Paradox may “disappear” under higher demands, and we prove this hypothesis by deriving a formula that provides the increase in demand that will guarantee that the addition of that new route will no longer increase travel cost since the new path will no longer be used. This result is established for any network in which the Braess Paradox originally occurs. This suggests that, in the case of congested, noncooperative networks, of which transportation networks are a prime example, a higher demand will negate the counterintuitive phenomenon known as the Braess Paradox. At the same time, this result demonstrates that extreme caution should be taken in the design of network infrastructure, including transportation networks, since at higher demands, new routes/pathways may not even be used! Introduction. – Congestion is a fundamental problem in a variety of network systems, ranging from urban transportation networks to electric power generation and distribution networks and the Internet [1]-[16]. Congestion leads to increases in travel time, wear and tear on our infrastructure, higher emissions due to vehicular idling, as well as to losses in productivity. Congested networks are flow-dependent with induced flows being the result of the behavior of the users of the particular network. Historically, there have been two principles of travel behavior, dating to Wardrop [8]-[10], corresponding to user-optimizing (U-O) behavior, in which travelers select their optimal routes of travel individually and unilaterally, leading to an equilibrium, and systemoptimizing (S-O) behavior, in which a central controller routes or assigns the flows to particular paths in the network so that the total cost is minimized. The Braess Paradox (cf. [1] and [11] for the translation of the article from German to English) in which the cost on used paths increases for all after the addition of a new route occurs only under user-optimizing or selfish behavior. Such behavior, however, is characteristic of commuting behavior, decentralized routing on the Internet, as well as the behavior of a spectrum of network systems, including electric power generation and distribution networks, in which decision-makers act independently and noncooperatively [2]-[5]. The recognition of the existence of the Braess paradox has led, in practice, to major policy decisions such as road closures in Seoul, Korea; in Stuttgart, Germany, as well as in New York City [6]. Interestingly, it was established that, for the specific Braess network [1], the paradox no longer occurred as the demand for travel increased [5]-[7]. This leads us to the hypothesis that, under a higher demand, the Braess Paradox is negated in that the new route, which resulted in increased travel time at a particular demand, will no longer be used. We establish this result through the derivation of a formula that is applicable to any network of general topology in which the Braess paradox originally occurs. For definiteness, we consider transportation networks in which the travel cost on each link is an increasing linear function of the flows (volume of traffic on the links) and we do not limit the analysis to separable functions as was the case in the original Braess Paradox network(s). We first briefly review the U-O transportation model, referred to, henceforth, as the traffic network equilibrium
منابع مشابه
Physical Proof of the Occurrence of the Braess Paradox in Electrical Circuits
The Braess Paradox is the counterintuitive phenomenon that can occur in a useroptimized network system, such as a transportation network, where adding an additional link to the network increases the cost (travel time) for every user. In electrical circuits, electrons, analogous to drivers in a transportation network, traverse the network so that no electron can unilaterally change its cost (vol...
متن کاملPower-Law Congestion Costs: Minimal Revenue (MR) Pricing and the Braess Paradox
We describe a simpler proof for Calvert and Keady's (C-K) theorem showing the non-occurrence of the Braess Paradox in networks with power-law congestion costs. We extend the C-K theorem to the case of elastic demand. We then use the methods of these proofs to develop several new theorems about the optimality of flows and the piecewise stability of Minimal Revenue (MR)Tolls in transportation net...
متن کاملPreface to "On a Paradox of Traffic Planning"
In 1968, Braess published the paper “Über ein Paradoxon aus der Verkehrsplanung” in the journal Unternehmensforschung. The paper was inspired by a seminar given by W. Knoedel in Muenster in 1967, when Braess was 29 years old. In the paper, Braess set out to clarify distinct concepts of travel behavior and presented what has since become the renowned Braess paradox. The paper was accepted by the...
متن کاملRobust uncapacitated multiple allocation hub location problem under demand uncertainty: minimization of cost deviations
The hub location–allocation problem under uncertainty is a real-world task arising in the areas such as public and freight transportation and telecommunication systems. In many applications, the demand is considered as inexact because of the forecasting inaccuracies or human’s unpredictability. This study addresses the robust uncapacitated multiple allocation hub location problem with a set of ...
متن کاملA Systematic Method to Analyze Transport Networks: Considering Traffic Shifts
Current network modeling practices usually assess the network performance at specified time interval, i.e. every 5 or 10 years time horizon. Furthermore, they are usually based on partially predictable data, which are being generated through various stochastic procedures. In this research, a new quantitative based methodology which combines combinatorial optimization modeling and transportation...
متن کامل