6
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Restoration of services in disrupted infrastructure systems: A network science approach

      research-article
      * ,
      PLoS ONE
      Public Library of Science

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Due to the ubiquitous nature of disruptive extreme events, functionality of the critical infrastructure systems (CIS) is constantly at risk. In case of a disruption, in order to minimize the negative impact to the society, service networks operating on the CIS should be restored as quickly as possible. In this paper, we introduce a novel network science inspired measure to quantify the criticality of components within a disrupted service network and develop a restoration heuristic (Cent-Restore) that prioritizes restoration efforts based on this measure. As an illustrative case study, we consider a road network blocked by debris in the aftermath of a natural disaster. The debris obstructs the flow of relief aid and search-and-rescue teams between critical facilities and disaster sites, debilitating the emergency service network. In this context, the problem is defined as finding a schedule to clear the roads with the limited resources. First, we develop a mixed-integer programming model for the problem. Then we validate the efficiency and accuracy of the Cent-Restore heuristic on randomly generated instances by comparing it to the model. Furthermore, we use Cent-Restore to recommend real-time restoration plans for disrupted road networks of Boston and Manhattan and analyze the performance of the plans over time through resilience curves. We compare Cent-Restore to the current restoration guidelines proposed by FEMA and other strategies that prioritize the restoration efforts based on different measures. As a result we confirm the importance of including specific post-disruption attributes of the networks to create effective restoration strategies. Moreover, we explore the relationship between a service network’s resilience and its topological and operational characteristics under different disruption scenarios. The methods and insights provided in this work can be extended to other disrupted large-scale critical infrastructure systems in which the ultimate goal is to enable the functions of the overlaying service networks.

          Related collections

          Most cited references38

          • Record: found
          • Abstract: found
          • Article: found
          Is Open Access

          Error and attack tolerance of complex networks

          Many complex systems, such as communication networks, display a surprising degree of robustness: while key components regularly malfunction, local failures rarely lead to the loss of the global information-carrying ability of the network. The stability of these complex systems is often attributed to the redundant wiring of the functional web defined by the systems' components. In this paper we demonstrate that error tolerance is not shared by all redundant systems, but it is displayed only by a class of inhomogeneously wired networks, called scale-free networks. We find that scale-free networks, describing a number of systems, such as the World Wide Web, Internet, social networks or a cell, display an unexpected degree of robustness, the ability of their nodes to communicate being unaffected by even unrealistically high failure rates. However, error tolerance comes at a high price: these networks are extremely vulnerable to attacks, i.e. to the selection and removal of a few nodes that play the most important role in assuring the network's connectivity.
            Bookmark
            • Record: found
            • Abstract: found
            • Article: found
            Is Open Access

            Attack vulnerability of complex networks

            We study the response of complex networks subject to attacks on vertices and edges. Several existing complex network models as well as real-world networks of scientific collaborations and Internet traffic are numerically investigated, and the network performance is quantitatively measured by the average inverse geodesic length and the size of the largest connected subgraph. For each case of attacks on vertices and edges, four different attacking strategies are used: removals by the descending order of the degree and the betweenness centrality, calculated for either the initial network or the current network during the removal procedure. It is found that the removals by the recalculated degrees and betweenness centralities are often more harmful than the attack strategies based on the initial network, suggesting that the network structure changes as important vertices or edges are removed. Furthermore, the correlation between the betweenness centrality and the degree in complex networks is studied.
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Error and attack tolerance of complex networks

                Bookmark

                Author and article information

                Contributors
                Role: ConceptualizationRole: Data curationRole: InvestigationRole: MethodologyRole: Project administrationRole: ResourcesRole: SoftwareRole: ValidationRole: VisualizationRole: Writing – original draft
                Role: Funding acquisitionRole: MethodologyRole: SupervisionRole: Writing – review & editing
                Role: Editor
                Journal
                PLoS One
                PLoS ONE
                plos
                plosone
                PLoS ONE
                Public Library of Science (San Francisco, CA USA )
                1932-6203
                2018
                14 February 2018
                : 13
                : 2
                : e0192272
                Affiliations
                [001] Mechanical and Industrial Engineering Department, Northeastern University, Boston, Massachusetts, United States of America
                Beijing Jiaotong University, CHINA
                Author notes

                Competing Interests: The authors have declared that no competing interests exist.

                Author information
                http://orcid.org/0000-0003-1967-4171
                Article
                PONE-D-17-26535
                10.1371/journal.pone.0192272
                5812613
                29444191
                a4b30bd2-f870-4a63-b916-9123fbab74dc
                © 2018 Ulusan, Ergun

                This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

                History
                : 14 July 2017
                : 16 November 2017
                Page count
                Figures: 14, Tables: 2, Pages: 28
                Funding
                Funded by: funder-id http://dx.doi.org/10.13039/100000001, National Science Foundation;
                Award ID: CMMI- 1537824
                Award Recipient :
                This work was supported by National Science Foundation CMMI – 1537824 ( https://www.nsf.gov/awardsearch/showAward?AWD_ID=1537824&HistoricalAwards=false).
                Categories
                Research Article
                Computer and Information Sciences
                Network Analysis
                Centrality
                Engineering and Technology
                Civil Engineering
                Transportation Infrastructure
                Roads
                Engineering and Technology
                Transportation
                Transportation Infrastructure
                Roads
                Social Sciences
                Economics
                Economic Models
                Supply and Demand
                Research and Analysis Methods
                Research Design
                Survey Research
                Census
                Physical Sciences
                Mathematics
                Geometry
                Geodesics
                Computer and Information Sciences
                Network Analysis
                Social Sciences
                Economics
                Macroeconomics
                Demand Curves
                Physical Sciences
                Mathematics
                Optimization
                Custom metadata
                The realistic instances (Boston/Manhattan) were constructed using publicly available data, which needed to be cleaned and appropriately formatted. Boston road network: http://www.mass.gov/anf/research-and-tech/it-serv-and-support/application-serv/office-of-geographic-information-massgis/datalayers/eotroads.html. Manhattan road network: http://gis.ny.gov/gisdata/inventories/details.cfm?DSID=932. Rest of the data is retrieved from the database of Hazus (FEMA’s software). Detailed explanation can be found in: https://www.fema.gov/summary-databases-hazus-multi-hazard. All the relevant data regarding the randomly generated instances are within the paper and its Supporting Information files.

                Uncategorized
                Uncategorized

                Comments

                Comment on this article