Vulnerability analysis for large-scale and congested road networks with demand uncertainty
To assess the vulnerability of congested road networks, the commonly used full network scan approach is to evaluate all possible scenarios of link closure using a form of traffic assignment. This approach can be computationally burdensome and may not be viable for identifying the most critical links in large-scale networks. In this study, an “impact area” vulnerability analysis approach is proposed to evaluate the consequences of a link closure within its impact area instead of the whole network. The proposed approach can significantly reduce the search space for determining the most critical links in large-scale networks. In addition, a new vulnerability index is introduced to examine properly the consequences of a link closure. The effects of demand uncertainty and heterogeneous travellers’ risk-taking behaviour are explicitly considered. Numerical results for two different road networks show that in practice the proposed approach is more efficient than traditional full scan approach for identifying the same set of critical links. Numerical results also demonstrate that both stochastic demand and travellers’ risk-taking behaviour have significant impacts on network vulnerability analysis, especially under high network congestion and large demand variations. Ignoring their impacts can underestimate the consequences of link closures and misidentify the most critical links.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 46 (2012)
Issue (Month): 3 ()
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/547/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Lam, William H.K. & Shao, Hu & Sumalee, Agachai, 2008. "Modeling impacts of adverse weather conditions on a road network with uncertainties in demand and supply," Transportation Research Part B: Methodological, Elsevier, vol. 42(10), pages 890-910, December.
- Chen, Anthony & Lee, Der-Horng & Jayakrishnan, R., 2002. "Computational study of state-of-the-art path-based traffic assignment algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 59(6), pages 509-518.
- Siu, Barbara W.Y. & Lo, Hong K., 2008. "Doubly uncertain transportation network: Degradable capacity and stochastic demand," European Journal of Operational Research, Elsevier, vol. 191(1), pages 166-181, November.
- Jenelius, Erik & Petersen, Tom & Mattsson, Lars-Göran, 2006. "Importance and exposure in road network vulnerability analysis," Transportation Research Part A: Policy and Practice, Elsevier, vol. 40(7), pages 537-560, August.
- Wu, Xing & (Marco) Nie, Yu, 2011. "Modeling heterogeneous risk-taking behavior in route choice: A stochastic dominance approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 45(9), pages 896-915, November.
- Dial, Robert B., 2006. "A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration," Transportation Research Part B: Methodological, Elsevier, vol. 40(10), pages 917-936, December.
- Michael Taylor & Somenahalli Sekhar & Glen D'Este, 2006. "Application of Accessibility Based Methods for Vulnerability Analysis of Strategic Road Networks," Networks and Spatial Economics, Springer, vol. 6(3), pages 267-291, September.
- Lo, Hong K. & Luo, X.W. & Siu, Barbara W.Y., 2006. "Degradable transport network: Travel time budget of travelers with heterogeneous risk aversion," Transportation Research Part B: Methodological, Elsevier, vol. 40(9), pages 792-806, November.
- Hazelton, Martin L., 2000. "Estimation of origin-destination matrices from link flows on uncongested networks," Transportation Research Part B: Methodological, Elsevier, vol. 34(7), pages 549-566, September.
- Anthony Chen & Chao Yang & Sirisak Kongsomsaksakul & Ming Lee, 2007. "Network-based Accessibility Measures for Vulnerability Analysis of Degradable Transportation Networks," Networks and Spatial Economics, Springer, vol. 7(3), pages 241-256, September.
- Bie, Jing & Lo, Hong K., 2010. "Stability and attraction domains of traffic equilibria in a day-to-day dynamical system formulation," Transportation Research Part B: Methodological, Elsevier, vol. 44(1), pages 90-107, January.
When requesting a correction, please mention this item's handle: RePEc:eee:transa:v:46:y:2012:i:3:p:501-516. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.