Skip to main content

Vulnerability Assessment of Spatial Networks: Models and Solutions

  • Conference paper
  • First Online:
  • 1205 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8596))

Abstract

In this paper we present a collection of combinatorial optimization problems that allows to assess the vulnerability of spatial networks in the presence of disruptions. The proposed measures of vulnerability along with the model of failure are suitable in many applications where the consideration of failures in the transportation system is crucial. By means of computational results, we show how the proposed methodology allows us to find useful information regarding the capacity of a network to resist disruptions and under which circumstances the network collapses.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Assimakopoulos, N.: A network interdiction model for hospital infection control. Comput. Biol. Med. 17(6), 413–422 (1987)

    Article  MathSciNet  Google Scholar 

  2. Church, R., Scaparra, M., Middleton, R.: Identifying critical infrastructure: the median and covering facility interdiction problems. Ann. Assoc. Am. Geogr. 94(3), 491–502 (2004)

    Article  Google Scholar 

  3. Cormican, K., Morton, D., Wood, R.: Stochastic network interdiction. Oper. Res. 46(2), 184–197 (1998)

    Article  MATH  Google Scholar 

  4. Fulkerson, D., Harding, G.: Maximizing the minimum source-sink path subject to a budget constraint. Math. Program. 13(1), 116–118 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  5. Golden, B.: A problem in network interdiction. Nav. Res. Logist. Q. 25(4), 711–713 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  6. Google. Google Maps (2013)

    Google Scholar 

  7. Hemmecke, R., Schültz, R., Woodruff, D.: Interdicting stochastic networks with binary interdiction effort. In: Woodruff, D. (ed.) Network Interdiction and Stochastic Integer Programming. Operations Research/Computer Science Interfaces Series, vol. 22, pp. 69–84. Springer, New York (2003)

    Chapter  Google Scholar 

  8. Israeli, E., Wood, R.: Shortest-path network interdiction. Networks 40(2), 97–111 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  9. Khachiyan, L., Boros, E., Borys, K., Elbassioni, K., Gurvich, V., Rudolf, G., Zhao, J.: On short paths interdiction problems: total and node-wise limited interdiction. Theor. Comput. Syst. 43(2), 204–233 (2008)

    Article  MathSciNet  Google Scholar 

  10. Murray, A.: An overview of network vulnerability modeling approaches. GeoJournal 78(2), 209–221 (2013)

    Article  Google Scholar 

  11. Phillips, C.: The network inhibition problem. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, STOC’93, pp. 776–785. ACM (1993)

    Google Scholar 

  12. Salmeron, J., Wood, K., Baldick, R.: Worst-case interdiction analysis of large-scale electric power grids. IEEE Trans. Power Syst. 24(1), 96–104 (2009)

    Article  Google Scholar 

  13. United Nations Statistics Division. UNSD Statistical Databases (2013)

    Google Scholar 

  14. Wollmer, R.: Removing arcs from a network. Oper. Res. 12(6), 934–940 (1964)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgements

This research was supported by Fondecyt Project #1121095, CONICYT, Ministerio de Educación, Chile. Eduardo Álvarez-Miranda thanks the Institute of Advanced Studies of the Università di Bologna from where he is a PhD Fellow.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Eduardo Álvarez-Miranda .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Álvarez-Miranda, E., Candia-Véjar, A., Carrizosa, E., Pérez-Galarce, F. (2014). Vulnerability Assessment of Spatial Networks: Models and Solutions. In: Fouilhoux, P., Gouveia, L., Mahjoub, A., Paschos, V. (eds) Combinatorial Optimization. ISCO 2014. Lecture Notes in Computer Science(), vol 8596. Springer, Cham. https://doi.org/10.1007/978-3-319-09174-7_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09174-7_37

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09173-0

  • Online ISBN: 978-3-319-09174-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics