6 research outputs found
ΠΠ΄Π΅Π½ΡΠΈΡΠΈΠΊΠ°ΡΠΈΡ ΠΏΠΎΠ²ΡΠ΅ΠΆΠ΄Π΅Π½ΠΈΠΉ ΠΌΠ΅ΡΠΎΠ΄ΠΎΠΌ ΠΏΠΎΠ΄Π²ΠΈΠΆΠ½ΠΎΠ³ΠΎ ΡΡΠ°ΠΊΡΠ°Π»Π° ΠΏΡΠΈ Π°Π²ΡΠΎΠΌΠ°ΡΠΈΠ·ΠΈΡΠΎΠ²Π°Π½Π½ΠΎΠΌ ΠΌΠΎΠ½ΠΈΡΠΎΡΠΈΠ½Π³Π΅
ΠΠ²ΡΠΎΠΌΠ°ΡΠΈΠ·ΠΈΡΠΎΠ²Π°Π½Π½Π°Ρ ΡΠΈΡΡΠ΅ΠΌΠ° ΠΌΠΎΠ½ΠΈΡΠΎΡΠΈΠ½Π³Π° ΡΠ΅Ρ
Π½ΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΡΠΎΡΡΠΎΡΠ½ΠΈΡ Π·Π΄Π°Π½ΠΈΡ ΠΈΠ»ΠΈ ΡΠΎΠΎΡΡΠΆΠ΅Π½ΠΈΡ ΠΏΡΠ΅Π΄Π½Π°Π·Π½Π°ΡΠ΅Π½Π° Π΄Π»Ρ Π²ΡΠ΄Π°ΡΠΈ Π°ΠΊΡΡΠ°Π»ΡΠ½ΠΎΠΉ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠ΅ΠΉ ΠΎ ΡΡΠ΅ΠΏΠ΅Π½ΠΈ ΠΈΠ·Π½ΠΎΡΠ° ΡΡΡΠΎΠΈΡΠ΅Π»ΡΠ½ΡΡ
ΠΊΠΎΠ½ΡΡΡΡΠΊΡΠΈΠΉ, Π° ΡΠ°ΠΊΠΆΠ΅ ΠΎ ΠΏΠΎΡΠ²Π»Π΅Π½ΠΈΠΈ Π² Π½ΠΈΡ
Π΄Π΅ΡΠ΅ΠΊΡΠΎΠ². Π Π°ΡΠΏΠΎΠ·Π½Π°Π²Π°Π½ΠΈΠ΅ Π΄Π΅ΡΠ΅ΠΊΡΠΎΠ² Π΄ΠΎΡΡΠΈΠ³Π°Π΅ΡΡΡ ΠΎΠ±ΡΠ°Π±ΠΎΡΠΊΠΎΠΉ ΠΌΠ½ΠΎΠ³ΠΎΡΠ΅Π½ΡΠΎΡΠ½ΠΎΠΉ ΠΌΠ°ΡΡΠΈΡΠ½ΠΎΠΉ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΈ Π½Π° Π²ΡΡ
ΠΎΠ΄Π΅ ΡΠΈΡΡΠ΅ΠΌΡ ΠΌΠΎΠ½ΠΈΡΠΎΡΠΈΠ½Π³Π°, ΡΠΎΡΡΠΎΡΡΠ΅ΠΉ ΠΈΠ· Π±ΠΎΠ»ΡΡΠΎΠ³ΠΎ ΡΠΈΡΠ»Π° Π΄Π°ΡΡΠΈΠΊΠΎΠ², Π½Π΅ΠΏΡΠ΅ΡΡΠ²Π½ΠΎ ΠΈΠ·ΠΌΠ΅ΡΡΡΡΠΈΡ
ΠΏΠ°ΡΠ°ΠΌΠ΅ΡΡΡ ΡΠΎΠΎΡΡΠΆΠ΅Π½ΠΈΡ: ΡΠ³Π»Ρ Π½Π°ΠΊΠ»ΠΎΠ½ΠΎΠ², ΡΡΠΊΠΎΡΠ΅Π½ΠΈΡ, Π΄Π΅ΡΠΎΡΠΌΠ°ΡΠΈΠΈ Π½Π΅ΡΡΡΠΈΡ
ΠΊΠΎΠ½ΡΡΡΡΠΊΡΠΈΠΉ. Π ΡΡΠ°ΡΡΠ΅ ΠΏΡΠ΅Π΄Π»ΠΎΠΆΠ΅Π½ ΠΌΠ΅ΡΠΎΠ΄ ΡΠ°ΡΠΏΠΎΠ·Π½Π°Π²Π°Π½ΠΈΡ Π΄Π΅ΡΠ΅ΠΊΡΠΎΠ², ΠΎΡΠ½ΠΎΠ²Π°Π½Π½ΡΠΉ Π½Π° Π°Π½Π°Π»ΠΈΠ·Π΅ ΠΏΠ΅ΡΠΈΠΎΠ΄ΠΈΡΠ΅ΡΠΊΠΈ ΠΏΠΎΡΡΡΠΏΠ°ΡΡΠΈΡ
Π² ΠΊΠΎΠΌΠΏΡΡΡΠ΅Ρ Π΄Π°Π½Π½ΡΡ
, ΠΏΡΠ΅Π΄ΡΡΠ°Π²Π»Π΅Π½Π½ΡΡ
Π² ΠΌΠ°ΡΡΠΈΡΠ½ΠΎΠΌ Π²ΠΈΠ΄Π΅. ΠΠ°ΠΆΠ΄Π°Ρ ΡΡΡΠΎΠΊΠ° ΠΌΠ°ΡΡΠΈΡΡ ΠΏΡΠ΅Π΄ΡΡΠ°Π²Π»ΡΠ΅Ρ ΠΈΠ· ΡΠ΅Π±Ρ ΠΏΠΎΡΠ»Π΅Π΄ΠΎΠ²Π°ΡΠ΅Π»ΡΠ½ΠΎΡΡΡ Π²Π΅Π»ΠΈΡΠΈΠ½, ΡΡΠΈΡΡΠ²Π°Π΅ΠΌΡΡ
Ρ ΠΊΠ°ΠΆΠ΄ΠΎΠ³ΠΎ Π΄Π°ΡΡΠΈΠΊΠ°. ΠΠΎΠ»ΠΈΡΠ΅ΡΡΠ²ΠΎ ΡΡΡΠΎΠΊ ΡΠ°Π²Π½ΠΎ ΡΠΈΡΠ»Ρ ΠΎΠΏΡΠ°ΡΠΈΠ²Π°Π΅ΠΌΡΡ
Π΄Π°ΡΡΠΈΠΊΠΎΠ². ΠΠ»Ρ ΠΎΠ±ΡΠ°Π±ΠΎΡΠΊΠΈ ΡΡΠΈΡ
Π΄Π°Π½Π½ΡΡ
ΠΈΠ· Π±ΠΎΠ»ΡΡΠΎΠΉ ΠΏΡΡΠΌΠΎΡΠ³ΠΎΠ»ΡΠ½ΠΎΠΉ ΠΌΠ°ΡΡΠΈΡΡ Π²ΡΠ΄Π΅Π»ΡΡΡ ΠΊΠ²Π°Π΄ΡΠ°ΡΠ½ΡΡ ΠΌΠ°ΡΡΠΈΡΡ, ΠΈΠ· ΠΊΠΎΡΠΎΡΠΎΠΉ Π² ΠΏΡΠΎΡΠ΅ΡΡΠ΅ ΠΎΠ±ΡΠ°Π±ΠΎΡΠΊΠΈ Π²ΡΠ΄Π΅Π»ΡΡΡ Π΅Π΅ Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊΠΈ: Π³Π»Π°Π²Π½ΡΠ΅ Π·Π½Π°ΡΠ΅Π½ΠΈΡ, Π³Π»Π°Π²Π½ΡΠ΅ Π²Π΅ΠΊΡΠΎΡΠ°, ΠΊΠΎΡΡΡΠΈΡΠΈΠ΅Π½ΡΡ ΠΊΠΎΡΡΠ΅Π»ΡΡΠΈΠΈ ΠΈ ΠΏΡ. ΠΠ²ΠΈΠΆΡΡΠ°ΡΡΡ ΠΊΠ²Π°Π΄ΡΠ°ΡΠ½Π°Ρ ΠΌΠ°ΡΡΠΈΡΠ° Π½Π°Π·Π²Π°Π½Π° Π½Π°ΠΌΠΈ Π΄Π²ΠΈΠΆΡΡΠΈΠΌΡΡ ΡΡΠ°ΠΊΡΠ°Π»ΠΎΠΌ. Π ΠΏΡΠΎΡΠ΅ΡΡΠ΅ ΠΌΠΎΠ΄Π΅Π»ΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΡΠΈΡΡΠ΅ΠΌΡ ΠΎΠΏΡΠ΅Π΄Π΅Π»ΡΡΡΡΡ Π·Π°Π²ΠΈΡΠΈΠΌΠΎΡΡΠΈ ΠΏΠ°ΡΠ°ΠΌΠ΅ΡΡΠΎΠ² ΠΌΠ°ΡΡΠΈΡΡ ΠΎΡ Π΄Π΅ΡΠ΅ΠΊΡΠΎΠ² Π² ΠΊΠΎΠ½ΡΡΡΡΠΊΡΠΈΠΈ. ΠΡΠ°ΠΊΡΠΈΡΠ΅ΡΠΊΠΎΠ΅ ΠΏΡΠΈΠΌΠ΅Π½Π΅Π½ΠΈΠ΅ ΠΏΡΠ΅Π΄Π»Π°Π³Π°Π΅ΠΌΠΎΠ³ΠΎ ΠΌΠ΅ΡΠΎΠ΄Π° ΠΏΡΠΎΠΈΠ»Π»ΡΡΡΡΠΈΡΠΎΠ²Π°Π½ΠΎ Π½Π° ΠΊΠΎΠΌΠΏΡΡΡΠ΅ΡΠ½ΠΎΠΉ ΠΌΠΎΠ΄Π΅Π»ΠΈ ΡΠ΅Π°Π»ΡΠ½ΠΎΠ³ΠΎ Π²ΡΡΠΎΡΠ½ΠΎΠ³ΠΎ Π·Π΄Π°Π½ΠΈΡ. ΠΡΠΏΠΎΠ»Π½Π΅Π½Π½ΡΠ΅ ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΡ ΠΏΠΎΠΊΠ°Π·ΡΠ²Π°ΡΡ, ΡΡΠΎ ΠΌΠ΅ΡΠΎΠ΄ ΠΏΠΎΠ΄Π²ΠΈΠΆΠ½ΠΎΠ³ΠΎ ΡΡΠ°ΠΊΡΠ°Π»Π° ΠΏΠΎΠ·Π²ΠΎΠ»ΡΠ΅Ρ ΠΈΠ΄Π΅Π½ΡΠΈΡΠΈΡΠΈΡΠΎΠ²Π°ΡΡ ΠΏΠΎΡΠ²Π»Π΅Π½ΠΈΠ΅ Π΄Π΅ΡΠ΅ΠΊΡΠΎΠ² Π² Π½Π΅ΡΡΡΠΈΡ
ΠΊΠΎΠ½ΡΡΡΡΠΊΡΠΈΡΡ
Competitive percolation strategies for network recovery
Restoring operation of critical infrastructure systems after catastrophic
events is an important issue, inspiring work in multiple fields, including
network science, civil engineering, and operations research. We consider the
problem of finding the optimal order of repairing elements in power grids and
similar infrastructure. Most existing methods either only consider system
network structure, potentially ignoring important features, or incorporate
component level details leading to complex optimization problems with limited
scalability. We aim to narrow the gap between the two approaches. Analyzing
realistic recovery strategies, we identify over- and undersupply penalties of
commodities as primary contributions to reconstruction cost, and we demonstrate
traditional network science methods, which maximize the largest connected
component, are cost inefficient. We propose a novel competitive percolation
recovery model accounting for node demand and supply, and network structure.
Our model well approximates realistic recovery strategies, suppressing growth
of the largest connected component through a process analogous to explosive
percolation. Using synthetic power grids, we investigate the effect of network
characteristics on recovery process efficiency. We learn that high structural
redundancy enables reduced total cost and faster recovery, however, requires
more information at each recovery step. We also confirm that decentralized
supply in networks generally benefits recovery efforts.Comment: 14 pages, 6 figure
Adaptive and Restorative Capacity Planning for Complex Infrastructure Networks: Optimization Algorithms and Applications
This research focuses on planning and scheduling of adaptive and restorative capacity enhancement efforts provided by complex infrastructure network in the aftermath of disruptive events. To maximize the adaptive capacity, we propose a framework to optimize the performance level to which a network can quickly adapt to post-disruption conditions by temporary means. Optimal resource allocation is determined with respect to the spatial dimensions of network components and available resources, the effectiveness of the resources, the importance of each element, and the system-wide impact to potential flows within the network. Optimal resource allocation is determined with respect to the spatial dimensions of network components and available resources, the effectiveness of the resources, the importance of each element, and the system-wide impact to potential flows within the network.
To optimize the restorative capacity enhancement, we present two mathematical formulations to assign restoration crews to disrupted components and maximize network resilience progress in any given time horizon. In the first formulation, the number of assigned restoration crews to each component can vary to increase the flexibility of models in the presence of different disruption scenarios. Along with considering the assumptions of the first formulation, the second formulation models the condition where the disrupted components can be partially active during the restoration process. We test the efficacy of proposed formulation, for adaptive and restorative capacity enhancement, on the realistic data set of 400-kV French electric transmission Network. The results indicate that the proposed formulations can be used for a wide variety of infrastructure networks and real-time restoration process planning.
Approaching the proposed formulations to reality introduces a synchronized routing problem for planning and scheduling restorative efforts for infrastructure networks in the aftermath of a disruptive event. In this problem, a set of restoration crews are dispatched from depots to a road network to restore the disrupted infrastructure network. Considering Binary and Proportional Active formulation, we propose two mathematical formulation in which the number of restoration crews assigned to each disrupted component, the arrival time of each assigned crew to each disrupted component and consequently the restoration rate associated with each disrupted component are considered as variables to increase the flexibility of the model in the presence of different disruptive events. To find the coordinated routes, we propose a relaxed mixed integer program as well as a set of valid inequalities which relates the planning and scheduling efforts to decision makers policies. The integration of the relaxed formulation and valid inequalities results in a lower bound for the original formulations. Furthermore, we propose a constructive heuristic algorithm based on the strong initial solution obtained from feasibility algorithm and a local search algorithm. Computational results on gas, water, and electric power infrastructure network instances from Shelby County, TN data, demonstrates both the effectiveness of the proposed model formulation, in solving small to medium scale problems, the strength of the initial solution procedure, especially for large-scale problems. We also prove that the heuristic algorithm to obtain the near optimal or near-optimal solutions
Disaster risk management of interdependent infrastructure systems for community resilience planning
This research focuses on developing methodologies to model the damage and recovery of interdependent infrastructure systems under disruptive events for community resilience planning. The overall research can be broadly divided into two parts: developing a model to simulate the post-disaster performance of interdependent infrastructure systems and developing decision frameworks to support pre-disaster risk mitigation and post-disaster recovery planning of the interdependent infrastructure systems towards higher resilience.
The Dynamic Integrated Network (DIN) model is proposed in this study to simulate the performance of interdependent infrastructure systems over time following disruptive events. It can consider three different levels of interdependent relationships between different infrastructure systems: system-to-system level, system-to-facility level and facility-to-facility level. The uncertainties in some of the modeling parameters are modeled. The DIN model first assesses the inoperability of the network nodes and links over time to simulate the damage and recovery of the interdependent infrastructure facilities, and then assesses the recovery and resilience of the individual infrastructure systems and the integrated network utilizing some network performance metrics. The recovery simulation result from the proposed model is compared to two conventional models, one with no interdependency considered, and the other one with only system-level interdependencies considered. The comparison results suggest that ignoring the interdependencies between facilities in different infrastructure systems would lead to poorly informed decision making. The DIN model is validated through simulating the recovery of the interdependent power, water and cellular systems of Galveston City, Texas after Hurricane Ike (2008).
Implementing strategic pre-disaster risk mitigation plan to improve the resilience of the interdependent infrastructure systems is essential for enhancing the social security and economic prosperity of a community. Majority of the existing infrastructure risk mitigation studies or projects focus on a single infrastructure system, which may not be the most efficient and effective way to mitigate the loss and enhance the overall community disaster resilience. This research proposes a risk-informed decision framework which could support the pre-disaster risk mitigation planning of several interdependent infrastructure systems. The characteristics of the Interdependent Infrastructure Risk Mitigation (IIRM) decision problem, such as objective, decision makers, constraints, etc., are clearly identified. A four-stage decision framework to solve the IIRM problem is also presented. The application of the proposed IIRM decision framework is illustrated using a case study on pre-disaster risk mitigation planning for the interdependent critical infrastructure systems in Jamaica. The outcome of the IIRM problem is useful for the decision makers to allocate limited risk mitigation budget or resources to the most critical infrastructure facilities in different systems to achieve greater community disaster resilience.
Optimizing the post-disaster recovery of damaged infrastructure systems is essential to alleviate the adverse impacts of natural disasters to communities and enhance their disaster resilience. As a result of infrastructure interdependencies, the complete functional restoration of a facility in one infrastructure system relies on not only the physical recovery of itself, but also the recovery of the facilities in other systems that it depends on. This study introduces the Interdependent Infrastructure Recovery Planning (IIRP) problem, which aims at optimizing the assignment and scheduling of the repair teams for an infrastructure system with considering the repair plan of the other infrastructure systems during the post-disaster recovery phase. Key characteristics of the IIRP problem are identified and a game theory-based IIRP decision framework is presented. Two recovery time-based performance metrics are introduced and applied to evaluate the efficiency and effectiveness of the post-disaster recovery plan. The IIRP decision framework is illustrated using the interdependent power and water systems of the Centerville virtual community subjected to seismic hazard