Institutional Repository

An investigation into Braess' paradox

Show simple item record

dc.contributor.advisor Potgieter, P.H. (Prof.) en
dc.contributor.advisor Wolvaardt, J.S. en Bloy, Leslie Arthur Keith en 2009-08-25T11:01:20Z 2009-08-25T11:01:20Z 2009-08-25T11:01:20Z 2007-02-28 en
dc.identifier.citation Bloy, Leslie Arthur Keith (2009) An investigation into Braess' paradox, University of South Africa, Pretoria, <> en
dc.description.abstract Braess' paradox is a counter-intuitive phenomenon which can occur in congesting networks. It refers to those cases where the introduction of a new link in the network results in the total travel time on the network increasing. The dissertation starts by introducing the traffic assignment problem and the concept of equilibrium in traffic assignment. The concept of equilibrium is based on Wardrop's first principle that all travellers will attempt to minimize their own travel time regardless of the effect on others. A literature review includes details of a number of papers that have been published investigating theoretical aspects of the paradox. There is also a brief description of Game Theory and the Nash Equilibrium. It has been shown that the equilibrium assignment is an example of Nash Equilibrium. The majority of work that has been published deals with networks where the delay functions that are used to compute the travel times on the links of the network do not include explicit representation of the capacity of the links. In this dissertation a network that is similar in form to the one first presented by Braess was constructed with the difference being that the well-known BPR function was used in the delay functions. This network was used to show that a number of findings that had been presented previously using simpler functions also applied to this network. It was shown that when it occurs, Braess' paradox only occurs over a range of values at relatively low levels of congestion. Real-world networks were then investigated and it was found that similar results occurred to those found in the simpler test networks that are often used in discussions of the paradox. Two methodologies of eliminating the paradox were investigated and the results are presented. en
dc.format.extent 1 online resource (x, 121 leaves)
dc.language.iso en en
dc.subject Eliminating the paradox en
dc.subject Braess' paradox in real-world networks en
dc.subject Nash equilibrium en
dc.subject BPR functions en
dc.subject Game theory en
dc.subject Braess' paradox en
dc.subject Equilibrium assignment en
dc.subject Wardrop en
dc.subject.ddc 388.31015118
dc.subject.lcsh Braess' paradox
dc.subject.lcsh Network analysis (Planning) -- Mathematical models
dc.subject.lcsh Traffic flow -- Mathematical models
dc.subject.lcsh Traffic congestion -- Mathematical models
dc.subject.lcsh Game theory
dc.title An investigation into Braess' paradox en
dc.type Thesis en
dc.description.department Decision Sciences en M.Sc. en

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search UnisaIR


My Account