Please use this identifier to cite or link to this item:
|dc.title||Designing reliable transport networks: The multiple Network spoiler approach|
|dc.identifier.citation||O'Brien, L.,Szeto, W.Y. (2008-12). Designing reliable transport networks: The multiple Network spoiler approach. Transactions Hong Kong Institution of Engineers 15 (4) : 2-10. ScholarBank@NUS Repository.|
|dc.description.abstract||Transport networks are expected to remain highly reliable to ensure that users can experience smooth travel under both normal and abnormal traffic conditions. To design a reliable transport network properly it is necessary to take into account users reactions to incidents which cause disruption in different parts of the network. In order to design a reliable network to deal with such events, it is necessary to capture the users route choice behavior under degraded conditions. Furthermore, for practical reasons, it is imperative that any improvement scheme should give priority to links in the network which are most vulnerable to failure. Therefore in this paper we formulate a reliable continuous network design problem (RCNDP) in which the link flow is assigned to different routes considering the risk-taking behavior of the network users when confronted by network uncertainty. To capture this behavior, we pose the RCNDP under the multiple network spoiler formulation of risk-averse traffic assignment. The ability of this model to introduce higher capacity expansions on links vulnerable to failure and consider many operational states to cater for the worst-case scenarios of network reliability is demonstrated through two numerical studies.|
|dc.subject||Reliable continuous network design problem|
|dc.subject||Risk-averse traffic assignment|
|dc.description.sourcetitle||Transactions Hong Kong Institution of Engineers|
|Appears in Collections:||Staff Publications|
Show simple item record
Files in This Item:
There are no files associated with this item.
checked on Aug 4, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.