FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2912762905> ?p ?o ?g. }

• W2912762905 abstract "The Braess paradox is a counterintuitive phenomenon that can occur in traffic networks, which are used by selfish users. It states that under certain circumstances the addition of a new road to a traffic network can result in increased travel times for all network users. This can have important consequences for the design of new traffic networks and for the extension of existing ones, since the naive assumption that the traffic situation in a road network always improves when adding new roads does not always hold. A detailed understanding of this paradox is needed, since possible negative externalities resulting from the construction of new roads have to be understood in order to be avoided. This is especially true, since the capacity of the road networks of many cities has long been reached and space for the construction of new roads is limited.Even though there have been numerous real world examples that indicate that the Braess paradox might occur in real world traffic networks, a deep understanding based on realistic traffic models is still missing. This thesis provides important stepping stones towards this much needed understanding. Most previous research on the topic focused on analysing deterministic mathematical models, the results of which are not directly transferable to real traffic networks. Often many oversimplifying assumptions were made: the description of traffic flow is reduced to unrealistic road travel time functions that increase linearly with the numbers of cars using the roads. Furthermore, perfect traffic information and perfectly rational decision makings of the network users were assumed.This thesis is dedicated to the study of the Braess paradox in networks of totally asymmetric exclusion processes (TASEPs). The TASEP models drivers as particles hopping on aone dimensional lattice. It is a simple stochastic transport model that includes microscopic interactions and exhibits a nonlinear current-density relation. The travel time functions of TASEPs have close-to-realistic shapes: they increase monotonically and diverge when approaching the maximum possible density. TASEPs do not reproduce all phenomena of real road traffic, but many basic features which are not included in most previous research on the Braess paradox, can be described.The network originally used by Braess is studied in several variants, but with the traffic flow described by TASEPs: various boundary conditions, route choice mechanisms and update types are considered. In a first step, it is shown that states realizing the paradox exist in TASEP networks. For this the decisions of the road users are tuned externally, i.e. users do not decide individually in an intelligent way, but are set to choose certain routes in thenetwork. The user optimum states of the networks without and with the new roads are identified and their travel times are compared.It is shown that Braess’ paradox occurs in large regions of the phase space in the networks with added periodic boundary conditions and random-sequential dynamics. With fixed amounts of drivers assigned to individual routes, gridlock states are found in large parts of phase space. Assigning drivers to their routes according to turning probabilities results instates with strong fluctuations in travel times that dominate large regions of the phase space. Unexpected phases in which the system is prone to oscillations between several unstable states are observed in the system with open boundary conditions and random-sequential dynamics: the Braess paradox is observed in an indirect way, since an increase of travel times is expected if this system was used by ‘intelligent’ particles. If parallel dynamics are employed instead of random-sequential dynamics, the treatment becomes more complicated. Traffic lights are implemented to avoid potential conflicts at junction sites. Braess’ paradox is also observed in this case.Beyond confirming that Braess’ paradox can be observed in TASEP networks, phase diagrams which characterize the influences of the new road in more detail are presented for all analysed variants of the network. Braess’ paradox is also realized if intelligent particles, which individually choose their routes, use the network. In the second part of the thesis, a route choice algorithm is implemented and results of a performance test in the Braess network with periodic boundary conditions are presented. All particles choose their routes individually based on this algorithm. Several types of traffic information are used as input for the algorithm. The Braess paradox occurs if particles decide based on their own memories from previous travel experiences. It is also realized if all particles base their decisions on publicly available approximations of future travel times. These approximations are calculated based on the current positions of all particles in the system and are a type of information similar to that provided by smartphone apps in real traffic networks. It is also shown that the paradox occurs if some particles base their decisions on personal information and the others on public information. This situation is very similar to that of real commuters’ scenarios. These results further stress the importance of Braess’ paradox for real road networks." @default.
• W2912762905 created "2019-02-21" @default.
• W2912762905 creator A5055775702 @default.
• W2912762905 date "2018-12-01" @default.
• W2912762905 modified "2023-09-27" @default.
• W2912762905 title "Stochastic Transport Models on Simple Networks: Phase Diagrams and Braess Paradox" @default.
• W2912762905 hasPublicationYear "2018" @default.
• W2912762905 type Work @default.
• W2912762905 sameAs 2912762905 @default.
• W2912762905 citedByCount "0" @default.
• W2912762905 crossrefType "dissertation" @default.
• W2912762905 hasAuthorship W2912762905A5055775702 @default.
• W2912762905 hasConcept C101097943 @default.
• W2912762905 hasConcept C10138342 @default.
• W2912762905 hasConcept C111472728 @default.
• W2912762905 hasConcept C127413603 @default.
• W2912762905 hasConcept C138885662 @default.
• W2912762905 hasConcept C162324750 @default.
• W2912762905 hasConcept C182306322 @default.
• W2912762905 hasConcept C207512268 @default.
• W2912762905 hasConcept C22212356 @default.
• W2912762905 hasConcept C2780586882 @default.
• W2912762905 hasConcept C31258907 @default.
• W2912762905 hasConcept C41008148 @default.
• W2912762905 hasConcept C42475967 @default.
• W2912762905 hasConceptScore W2912762905C101097943 @default.
• W2912762905 hasConceptScore W2912762905C10138342 @default.
• W2912762905 hasConceptScore W2912762905C111472728 @default.
• W2912762905 hasConceptScore W2912762905C127413603 @default.
• W2912762905 hasConceptScore W2912762905C138885662 @default.
• W2912762905 hasConceptScore W2912762905C162324750 @default.
• W2912762905 hasConceptScore W2912762905C182306322 @default.
• W2912762905 hasConceptScore W2912762905C207512268 @default.
• W2912762905 hasConceptScore W2912762905C22212356 @default.
• W2912762905 hasConceptScore W2912762905C2780586882 @default.
• W2912762905 hasConceptScore W2912762905C31258907 @default.
• W2912762905 hasConceptScore W2912762905C41008148 @default.
• W2912762905 hasConceptScore W2912762905C42475967 @default.
• W2912762905 hasLocation W29127629051 @default.
• W2912762905 hasOpenAccess W2912762905 @default.
• W2912762905 hasPrimaryLocation W29127629051 @default.
• W2912762905 hasRelatedWork W132170676 @default.
• W2912762905 hasRelatedWork W1679809766 @default.
• W2912762905 hasRelatedWork W2051760739 @default.
• W2912762905 hasRelatedWork W2156975709 @default.
• W2912762905 hasRelatedWork W2218552071 @default.
• W2912762905 hasRelatedWork W2375271787 @default.
• W2912762905 hasRelatedWork W2494376632 @default.
• W2912762905 hasRelatedWork W2546777879 @default.
• W2912762905 hasRelatedWork W2597267505 @default.
• W2912762905 hasRelatedWork W2800097827 @default.
• W2912762905 hasRelatedWork W3031017702 @default.
• W2912762905 hasRelatedWork W3094520237 @default.
• W2912762905 hasRelatedWork W60451962 @default.
• W2912762905 hasRelatedWork W610753317 @default.
• W2912762905 hasRelatedWork W627355791 @default.
• W2912762905 hasRelatedWork W628947380 @default.
• W2912762905 hasRelatedWork W651730966 @default.
• W2912762905 hasRelatedWork W858129188 @default.
• W2912762905 hasRelatedWork W87805101 @default.
• W2912762905 hasRelatedWork W88238158 @default.
• W2912762905 isParatext "false" @default.
• W2912762905 isRetracted "false" @default.
• W2912762905 magId "2912762905" @default.
• W2912762905 workType "dissertation" @default.