IDEAS home Printed from https://ideas.repec.org/a/kap/netspa/v7y2007i3p241-256.html
   My bibliography  Save this article

Network-based Accessibility Measures for Vulnerability Analysis of Degradable Transportation Networks

Author

Listed:
  • Anthony Chen
  • Chao Yang
  • Sirisak Kongsomsaksakul
  • Ming Lee

Abstract

Accessibility is a fundamental concept in transportation analysis and urban planning. Typically, accessibility refers to the ‘ease’ of reaching opportunities for activities and services and can be used to assess the performance of a transportation and urban system. In this paper, we present network-based accessibility measures for assessing vulnerability of degradable transportation networks. The network-based accessibility measures consider the consequence of one or more link failures in terms of network travel time or generalized travel cost increase as well as the behavioral responses of users due to the failure in the network. To model different dimensions of travel behavioral responses, a combined travel demand model is adopted to estimate the long-term equilibrium network condition due to network disruptions. Numerical examples are conducted to demonstrate the feasibility of the proposed vulnerability measures for assessing degradable transportation networks. The results indicate that the accessibility measures derived from the combined travel demand model are capable of measuring the consequences of both demand and supply changes in the network and have the flexibility to reflect the effects of different travel choice dimensions on the network vulnerability. Copyright Springer Science+Business Media, LLC 2007

Suggested Citation

  • 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.
    • Handle: RePEc:kap:netspa:v:7:y:2007:i:3:p:241-256
    DOI: 10.1007/s11067-006-9012-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11067-006-9012-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11067-006-9012-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Fisk, Caroline, 1980. "Some developments in equilibrium traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 14(3), pages 243-255, September.
    2. Spiess, Heinz & Florian, Michael, 1989. "Optimal strategies: A new assignment model for transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 23(2), pages 83-102, April.
    3. (ed.), 1992. "Index," Books, Edward Elgar Publishing, number 1241.
    4. Berdica, Katja, 2002. "An introduction to road vulnerability: what has been done, is done and should be done," Transport Policy, Elsevier, vol. 9(2), pages 117-127, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lam, W. H. K. & Gao, Z. Y. & Chan, K. S. & Yang, H., 1999. "A stochastic user equilibrium assignment model for congested transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 33(5), pages 351-368, June.
    2. Liu, Qi & Chow, Joseph Y.J., 2022. "Efficient and stable data-sharing in a public transit oligopoly as a coopetitive game," Transportation Research Part B: Methodological, Elsevier, vol. 163(C), pages 64-87.
    3. Wang, Zhichao & Jiang, Rui & Jiang, Yu & Gao, Ziyou & Liu, Ronghui, 2024. "Modelling bus bunching along a common line corridor considering passenger arrival time and transfer choice under stochastic travel time," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 181(C).
    4. Alireza Ermagun & David M Levinson, 2019. "Development and application of the network weight matrix to predict traffic flow for congested and uncongested conditions," Environment and Planning B, , vol. 46(9), pages 1684-1705, November.
    5. Alireza Khani & Mark Hickman & Hyunsoo Noh, 2015. "Trip-Based Path Algorithms Using the Transit Network Hierarchy," Networks and Spatial Economics, Springer, vol. 15(3), pages 635-653, September.
    6. Lam, William H. K. & Zhou, Jing & Sheng, Zhao-han, 2002. "A capacity restraint transit assignment with elastic line frequency," Transportation Research Part B: Methodological, Elsevier, vol. 36(10), pages 919-938, December.
    7. Sun, S. & Szeto, W.Y., 2018. "Logit-based transit assignment: Approach-based formulation and paradox revisit," Transportation Research Part B: Methodological, Elsevier, vol. 112(C), pages 191-215.
    8. Zhao, Hui & Yan, Xuedong & Gao, Ziyou, 2013. "Transportation serviceability analysis for metropolitan commuting corridors based on modal choice modeling," Transportation Research Part A: Policy and Practice, Elsevier, vol. 49(C), pages 270-284.
    9. Arampatzis, G. & Kiranoudis, C. T. & Scaloubacas, P. & Assimacopoulos, D., 2004. "A GIS-based decision support system for planning urban transportation policies," European Journal of Operational Research, Elsevier, vol. 152(2), pages 465-475, January.
    10. Bergström, Anna & Krüger, Niclas A., 2013. "Modeling passenger train delay distributions: evidence and implications," Working papers in Transport Economics 2013:3, CTS - Centre for Transport Studies Stockholm (KTH and VTI).
    11. Richard Connors & David Watling, 2015. "Assessing the Demand Vulnerability of Equilibrium Traffic Networks via Network Aggregation," Networks and Spatial Economics, Springer, vol. 15(2), pages 367-395, June.
    12. Kai Lu & Tao Tang & Chunhai Gao, 2020. "The Depth-First Optimal Strategy Path Generation Algorithm for Passengers in a Metro Network," Sustainability, MDPI, vol. 12(13), pages 1-16, July.
    13. Tong, C.O. & Wong, S.C., 1998. "A stochastic transit assignment model using a dynamic schedule-based network," Transportation Research Part B: Methodological, Elsevier, vol. 33(2), pages 107-121, April.
    14. Xu, Zhandong & Xie, Jun & Liu, Xiaobo & Nie, Yu (Marco), 2020. "Hyperpath-based algorithms for the transit equilibrium assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
    15. Ding Luo & Oded Cats & Hans Lint, 2020. "Can passenger flow distribution be estimated solely based on network properties in public transport systems?," Transportation, Springer, vol. 47(6), pages 2757-2776, December.
    16. E. Codina & A. Marín & F. López, 2013. "A model for setting services on auxiliary bus lines under congestion," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(1), pages 48-83, April.
    17. Preston, John, 2008. "Competition in transit markets," Research in Transportation Economics, Elsevier, vol. 23(1), pages 75-84, January.
    18. Xu, Xiangdong & Qu, Kai & Chen, Anthony & Yang, Chao, 2021. "A new day-to-day dynamic network vulnerability analysis approach with Weibit-based route adjustment process," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).
    19. Guido Gentile, 2018. "New Formulations of the Stochastic User Equilibrium with Logit Route Choice as an Extension of the Deterministic Model," Service Science, INFORMS, vol. 52(6), pages 1531-1547, December.
    20. Mengying Cui & David Levinson, 2018. "Accessibility analysis of risk severity," Transportation, Springer, vol. 45(4), pages 1029-1050, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:kap:netspa:v:7:y:2007:i:3:p:241-256. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.