File Download
Supplementary

postgraduate thesis: Price of anarchy for reliability-based traffic assignment and network design

TitlePrice of anarchy for reliability-based traffic assignment and network design
Authors
Advisors
Issue Date2015
PublisherThe University of Hong Kong (Pokfulam, Hong Kong)
Citation
Wang, B. [王蓓]. (2015). Price of anarchy for reliability-based traffic assignment and network design. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR.
AbstractThis study aims at investigating the impacts of supply uncertainty on the self- routing behavior of travelers when travel demands are fixed. This study proposes a distribution-free reliability-based user equilibrium traffic assignment problem that consider supply uncertainty, in which both the risk aversion of travelers and system manager are captured. It proposes a reliability-based user equilibrium model with speed limits that considers the system wide impacts of speed limits on traffic flows and travel time variations, which has not been addressed in the literature before. The price of anarchy (PoA) for the reliability-based traffic assignment problems (without and with speed limits) are defined, and upper bounds of the PoA of reliability-based traffic assignment problems with Bureau of Public Road (BPR) type travel time functions are derived. This study also extends the application of the PoA for traffic assignment problems to distribution-free reliability-based network design problems that consider supply uncertainty, which also include the traditional network design problems as a special case. It proposes capacity expansion network design problems and capacity and toll network design problems. It defines the PoAs for (reliability-based) network design problems, which is the worst-case ratio between the optimal objective function values of a reliability-based user equilibrium design and a reliability-based system optimal design. The PoAs for reliability-based network design problems are proven to be bounded above by the upper bounds of that for reliability-based traffic assignment problems of the same instance, before any link expansion.
DegreeDoctor of Philosophy
SubjectTraffic assignment
Game theory
Dept/ProgramCivil Engineering
Persistent Identifierhttp://hdl.handle.net/10722/267786

 

DC FieldValueLanguage
dc.contributor.advisorSzeto, WY-
dc.contributor.advisorWong, SC-
dc.contributor.authorWang, Bei-
dc.contributor.author王蓓-
dc.date.accessioned2019-03-01T03:44:51Z-
dc.date.available2019-03-01T03:44:51Z-
dc.date.issued2015-
dc.identifier.citationWang, B. [王蓓]. (2015). Price of anarchy for reliability-based traffic assignment and network design. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR.-
dc.identifier.urihttp://hdl.handle.net/10722/267786-
dc.description.abstractThis study aims at investigating the impacts of supply uncertainty on the self- routing behavior of travelers when travel demands are fixed. This study proposes a distribution-free reliability-based user equilibrium traffic assignment problem that consider supply uncertainty, in which both the risk aversion of travelers and system manager are captured. It proposes a reliability-based user equilibrium model with speed limits that considers the system wide impacts of speed limits on traffic flows and travel time variations, which has not been addressed in the literature before. The price of anarchy (PoA) for the reliability-based traffic assignment problems (without and with speed limits) are defined, and upper bounds of the PoA of reliability-based traffic assignment problems with Bureau of Public Road (BPR) type travel time functions are derived. This study also extends the application of the PoA for traffic assignment problems to distribution-free reliability-based network design problems that consider supply uncertainty, which also include the traditional network design problems as a special case. It proposes capacity expansion network design problems and capacity and toll network design problems. It defines the PoAs for (reliability-based) network design problems, which is the worst-case ratio between the optimal objective function values of a reliability-based user equilibrium design and a reliability-based system optimal design. The PoAs for reliability-based network design problems are proven to be bounded above by the upper bounds of that for reliability-based traffic assignment problems of the same instance, before any link expansion. -
dc.languageeng-
dc.publisherThe University of Hong Kong (Pokfulam, Hong Kong)-
dc.relation.ispartofHKU Theses Online (HKUTO)-
dc.rightsThe author retains all proprietary rights, (such as patent rights) and the right to use in future works.-
dc.rightsThis work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.-
dc.subject.lcshTraffic assignment-
dc.subject.lcshGame theory-
dc.titlePrice of anarchy for reliability-based traffic assignment and network design-
dc.typePG_Thesis-
dc.description.thesisnameDoctor of Philosophy-
dc.description.thesislevelDoctoral-
dc.description.thesisdisciplineCivil Engineering-
dc.description.naturepublished_or_final_version-
dc.date.hkucongregation2016-
dc.identifier.mmsid991044081525203414-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats