• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Algorithms for improving the convergence of trip matrix estimation and assignment models

Carvalho, Maria do Sameiro Fario Brandão Soares de January 2005 (has links)
No description available.
2

An investigation into Braess' paradox

Bloy, Leslie Arthur Keith 28 February 2007 (has links)
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. / Decision Sciences / M.Sc.
3

An investigation into Braess' paradox

Bloy, Leslie Arthur Keith 28 February 2007 (has links)
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. / Decision Sciences / M.Sc.

Page generated in 0.0157 seconds