International Conference on Applications of Statistics and Probability in Civil Engineering (ICASP) (12th : 2015)

The computational complexity of probabilistic Interdependent Network Design Problems González, Andrés D.; Dueñas-Osorio, Leonardo; Sánchez-Silva, Mauricio; Medaglia, Andrés L. 2015-07

Your browser doesn't seem to have a PDF viewer, please download the PDF to view this item.

Notice for Google Chrome users:
If you are having trouble viewing or searching the PDF with Google Chrome, please download it here instead.

Item Metadata


53032-Paper_379_Gonzalez_rev_2015_06_30.pdf [ 334.17kB ]
JSON: 53032-1.0076118.json
JSON-LD: 53032-1.0076118-ld.json
RDF/XML (Pretty): 53032-1.0076118-rdf.xml
RDF/JSON: 53032-1.0076118-rdf.json
Turtle: 53032-1.0076118-turtle.txt
N-Triples: 53032-1.0076118-rdf-ntriples.txt
Original Record: 53032-1.0076118-source.json
Full Text

Full Text

12th International Conference on Applications of Statistics and Probability in Civil Engineering, ICASP12 Vancouver, Canada, July 12-15, 2015  1 The Computational Complexity of Probabilistic Interdependent Network Design Problems Andrés D. González Graduate Student, Dept. of Civil & Environmental Engineering, Rice Univ., Houston, USA  Dept. of Civil & Environmental Engineering, Univ. de los Andes, Bogotá, Colombia  Leonardo Dueñas-Osorio Associate Professor, Dept. of Civil & Environmental Engineering, Rice Univ., Houston, USA Mauricio Sánchez-Silva Professor, Dept. of Civil & Environmental Engineering, Univ. de los Andes, Bogotá, Colombia Andrés L. Medaglia Professor, Dept. of Industrial Engineering, Univ. de los Andes, Bogotá, Colombia   ABSTRACT: We present a rigorous study of the computational complexity of an Interdependent Network Design Problem (INDP) solution model, which is at the core of future infrastructure restoration studies. The paper details how each constraint in the INDP formulation adds to the overall complexity, while also revealing strategies to tame the computational demands for large interdependent networks. It is shown how some algorithms that are used to enhance the Network Design Problem (NDP) (Poss 2011), including decomposition techniques, can be cleverly adapted to the INDP model. Computational examples are based on diverse yet idealized topologies, to illustrate the sensitivity of the INDP model to input parameters and constraints, as well as the underlying topological properties of the studied systems. The present study paves the way for future approaches to improve the INDP and its Mixed-Integer Programming (MIP) model, particularly in terms of its efficiency and capability to handle large size instances, and by extension, its ability to support practical infrastructure decision making and resilience analyses. 1. INTRODUCTION Recent approaches to study infrastructure networks have highlighted the importance of interdependency among them, especially when studying their resilience. Buldyrev et al. (2010) and Dueñas-Osorio et al. (2007) showed theoretically and computationally that a system of interdependent networks has increased vulnerability and is susceptible to cascading failures. Ouyang & Dueñas-Osorio (2011) presented an approach to design and retrofit infrastructure systems to reduce the likelihood of cascading failures, by properly accounting for interdependencies. From a recovery perspective, González et al. (2014) defined the Interdependent Network Design Problem (INDP) as the problem of finding the least-cost recovery strategy for a partially destroyed system of interdependent infrastructure networks. To solve the  INDP, González et al. (2014) also proposed a Mixed Integer Programming (MIP) model, which seeks the minimum-cost recovery strategy while considering operational constraints, limited availability of resources, and interdependencies between the networks.  Such model showed high applicability in studying realistic scenarios, such as for optimizing the recovery strategies of the gas, power, and water networks in Shelby County, TN, after an earthquake. This paper studies the computational complexity of the INDP in a probabilistic context, related to the likelihood of 12th International Conference on Applications of Statistics and Probability in Civil Engineering, ICASP12 Vancouver, Canada, July 12-15, 2015  2 diverse disaster scenarios. The paper starts by presenting a re-formulation of the INDP-MIP model based on the former work by González et al. (2014), specifying now its structure and how it can be used in a probabilistic framework. Then, it assesses the complexity class of the INDP, and analogous problems related to finding optimal flows through a system of networks. Afterwards, the paper presents an approach to analyze the INDP-MIP model complexity from a numerical approach, studying the dependence between its running time and parameters such as the size and density of the system of networks, its level of interdependency, and the availability of resources. Computational experiments are shown to also study the INDP-MIP model complexity under different topologies. Then, conclusions and ideas for future work follow. 2. THE INTERDEPENDENT NETWORK DESIGN PROBLEM (INDP)-MIP MODEL To solve the INDP, González et al. (2014) proposed an MIP model that accounts for the costs associated to component reconstruction, flow of commodities, unsatisfied demands, and geographical preparation of component repair sites. This INDP-MIP model considers constraints related to flow balance, limited flow capacities, limited availability of resources for the reconstruction process, and interdependencies.  The latter includes physical interdependency between networks (implying that certain components should be functional in a system in order for others to be functional in different systems as well), and geographical interdependency (allowing for costs reductions by simultaneously repairing co-located components). We propose the following re-formulation of the INDP-MIP model, in order to make the structure of the optimization problem more transparent for computational complexity analyses, by using generalized sets of network elements (to comprise arcs and nodes). The use of sets of elements reduces by half the original sets of constraints, and facilitates associating them with properties of the model relevant to its time-complexity (to be analyzed in section 3.1). Without loss of generality, we assume that only one commodity can flow through each network. To formulate this more transparent problem, let us define the following sets, parameters, and variables as: 𝒦  Set of infrastructure networks 𝑅  Set of limited resources to be used in the reconstruction process 𝒮 Set of geographical spaces (spatial distribution of the area that contains the infrastructure networks) 𝒩  Set of nodes before a destructive event 𝒩𝑘  Set of nodes in network 𝑘 ∈ 𝒦  before a destructive event 𝒩𝑘′  Set of nodes destroyed in network 𝑘 ∈ 𝒦  𝒜  Set of arcs before a destructive event 𝒜𝑘  Set of arcs in network 𝑘 ∈ 𝒦  before a destructive event 𝒜𝑘′    Set of arcs destroyed in network 𝑘 ∈ 𝒦  𝐸 Set of elements in the system of networks, i.e., 𝒜 ∪𝒩 𝐸𝑘 Set of elements in network k, i.e.,𝒜𝑘 ∪𝒩𝑘 𝐸𝑘′  Set of destroyed elements in network  𝑘 ∈𝒦, i.e., 𝒜𝑘′ ∪𝒩𝑘′ 𝑓𝑒  Reconstruction cost of element 𝑒 ∈ 𝐸 𝑐𝑒  Flow unitary cost through arc 𝑒 ∈ 𝒜 𝑀𝑒+  Cost of oversupply in node 𝑒 ∈ 𝒩 𝑀𝑒− Cost of unsatisfied demand in node 𝑒 ∈ 𝒩 𝑔𝑠  Cost of preparing geographical space 𝑠 ∈ 𝑆 𝑢𝑒  Capacity of arc 𝑒 ∈ 𝒜 𝑏𝑒 Demand/supply in node 𝑒 ∈ 𝒩 𝑣𝑟  Total availability of resource 𝑟 ∈ 𝑅  ℎ𝑒𝑟  Amount of resource 𝑟 ∈ 𝑅  used to reconstruct element 𝑒 ∈ 𝐸 𝛽𝑒𝑠  Zero-one parameter indicating whether or not space 𝑠 ∈ 𝑆  has to be prepared when reconstructing element 𝑒 ∈ 𝐸 𝛾𝑒?̃? Zero-one parameter indicating whether or not element 𝑒 ∈ 𝐸  depends physically on element ?̃? ∈ 𝐸, where 𝑒 ≠ ?̃? 𝑥𝑒  Flow through arc 𝑒 ∈ 𝒜  𝛿𝑒+ Oversupply in node 𝑒 ∈ 𝒩  𝛿𝑒+ Unsatisfied demand in node 𝑒 ∈ 𝒩  𝑦𝑒  Zero-one variable indicating whether or not element 𝑒 ∈ 𝐸 becomes functional 𝑧𝑠 Zero-one variable indicating whether or not geographical space 𝑠 ∈ 𝑆 is prepared. 12th International Conference on Applications of Statistics and Probability in Civil Engineering, ICASP12 Vancouver, Canada, July 12-15, 2015  3 Based on the previous definitions, the proposed MIP re-formulation for the INDP is:  minimize ∑𝑘∈𝒦(∑𝑒∈𝐸𝑘′𝑓𝑒𝑦𝑒 + ∑𝑒∈𝒜𝑘𝑐𝑒𝑥𝑒  + ∑𝑒∈𝒩𝑘(𝑀𝑒+𝛿𝑒+ +𝑀𝑒−𝛿𝑒−))+∑𝑠∈𝒮𝑔𝑠𝑧𝑠 (1) subject to, ∑𝑗:(𝑖,𝑗)∈𝒜𝑘𝑥(𝑖,𝑗) − ∑𝑗:(𝑗,𝑖)∈𝒜𝑘𝑥(𝑗,𝑖) + 𝛿𝑖+ − 𝛿𝑖−= 𝑏𝑖 , ∀𝑘 ∈ 𝒦, ∀𝑖 ∈ 𝒩𝑘,  (2) −𝑥(𝑖,𝑗) + 𝑢(𝑖,𝑗)𝑦𝑒 ≥ 0,        ∀𝑘 ∈ 𝒦, ∀(𝑖, 𝑗)∈ 𝒜𝑘 , ∀𝑒 ∈ {𝑖, 𝑗, (𝑖, 𝑗)}, (3) ∑𝑘∈𝒦∑𝑒∈𝐸𝑘′ℎ𝑒𝑟𝑦𝑒 ≤ 𝑣𝑟 ,     ∀𝑟 ∈ ℛ, (4) ∑𝑒∈𝐸𝑘𝛾𝑒?̃?𝑦𝑒 − 𝑦?̃? ≥ 0,         ∀𝑘, ?̃? ∈ 𝒦, ∀?̃? ∈ 𝐸?̃? | ∑𝑒∈𝐸𝑘𝛾𝑒?̃? > 0,  (5) 𝑧𝑠 − 𝛽𝑒𝑠𝑦𝑒 ≥  0,        ∀𝑘 ∈ 𝒦, ∀𝑒 ∈ 𝐸𝑘′ , ∀𝑠∈ 𝒮|𝛽𝑒𝑠 > 0, (6) 𝛿𝑒+ ≥ 0,        ∀𝑘 ∈ 𝒦, ∀𝑒 ∈ 𝒩𝑘, (7) 𝛿𝑒− ≥ 0,        ∀𝑘 ∈ 𝒦, ∀𝑒 ∈ 𝒩𝑘, (8) 𝑥𝑒 ≥ 0,        ∀𝑘 ∈ 𝒦, ∀𝑒 ∈ 𝒜𝑘 , (9) 𝑦𝑒  ∈ {0,1},        ∀𝑘 ∈ 𝒦, ∀𝑒 ∈ 𝐸𝑘, (10) 𝑧𝑠 ∈ {0,1},        ∀𝑠 ∈ 𝒮. (11)  Note that each 𝑒 ∈ 𝒜𝑘  is uniquely defined by a pair of nodes (𝑖, 𝑗), where 𝑖 ∈ 𝒩𝑘  represents the starting node and 𝑗 ∈ 𝒩𝑘  the ending node. The objective function (1) minimizes the recovery costs associated to reconstructing damaged components (first term), the total flow costs (second term), the unbalance costs related to over or under supply (third term), and the total cost of preparing the different areas for the reconstruction process (fourth term). The set of constraints (2) guarantee the commodity flow balance at each node, for each infrastructure network. Constraints (3) ensure that flows through an arc are limited by a given capacity, and can exist only if the arc is functional, along with its starting and ending nodes. Constraints (4) limit the use of each resource. Constraints (5) model the physical interdependence between networks, by guaranteeing that for a given element to be functional, at least one from a set of required elements should be functional as well. If the support components (set of required components) are more than two, the element is called multiply supported. On the other hand, if there is only one support component, the element is called simply supported. Constraints (6) ensure that when any element is reconstructed, the area that contains it has to be prepared. Note that constraints (5) and (6) take place only if a component is interdependent to others, i.e., if ∑𝑒∈𝐸𝑘 𝛾𝑒?̃? > 0 and 𝛽𝑒𝑠 > 0 respectively. Finally, constraints (7)-(11) are related to the nature of the variables. Note that the INDP-MIP formulation is fully deterministic, as all the sets and parameters are assumed to be known. Nevertheless, the INDP-MIP model could be used in a probabilistic framework, if we consider the uncertainty related to the functionality of the system components and the topology of the networks. Given a particular hazard, each component is assumed to have a specific probability of destruction. Such a probability will depend on the specific system and hazard under study, and should consider the fragility of the components and the magnitude of the studied damaging events. To use the INDP-MIP formulation in a probabilistic scenario, one could use methods such as simulation, stochastic and robust optimization, among others. For this study, we used Monte-Carlo simulation, based on generating random disaster scenarios according to a given destruction probability distribution. For each disaster scenario, the INDP-MIP model would indicate the optimal recovery strategy, and will have different running times. 12th International Conference on Applications of Statistics and Probability in Civil Engineering, ICASP12 Vancouver, Canada, July 12-15, 2015  4 The following section will focus on studying the running times of the INDP-MIP model, and its dependence on parameters such as the size and density of the system and the availability of resources for the reconstruction. The effect of network topology is also studied afterwards. 3. COMPUTATIONAL COMPLEXITY OF THE INDP In general, MIP models based on linear constraints belong to the NP-hard computational complexity class. Nevertheless, an in-depth analysis should be performed on the proposed INDP-MIP formulation, as it can be considered  an extension or generalization of well know problems in literature, such as the Minimum Cost Flow Problem (MCFP) (Vaidyanathan 2010; Hamacher et al. 2007; Tomlin 1966), and the classical Network Design Problem (NDP) (Poss 2011; Dionne & Florian 1979). First, consider a context where there is no set of limiting resources, and the geographical preparation costs are negligible. Then, under this context variable 𝑧𝑠would not be relevant, and constraints (4), (6), and (11) would not exist. Now, assume the simple case where there is only a single network. If such a network is fully functional (i.e., there are no destroyed components), then 𝑦𝑒 = 1, ∀𝑒 ∈ 𝐸 , which in turn implies that 𝑧𝑠 = 0, ∀𝑠 ∈ 𝒮.  Then, only constraints (2) and (3) would take place and the problem would not be MIP anymore, as all the integer variables are known beforehand. Then, under this configuration, the INDP-MIP model would be identical to the MCFP, which is solvable in polynomial time (Orlin 1997). On the other hand, if we assume a single partially destroyed network, only constraints (2) and (3) would take place again. Nevertheless, 𝑦𝑒 would be unknown. Then, under this configuration, the INDP-MIP model would be identical to the classical NDP, and would be NP-complete (Johnson et al. 1978). By studying multiple networks simultaneously, the INDP-MIP model would be solving simultaneous NDPs for each network. Nevertheless, the more interdependent the networks are, the more constraints (5) will take place. This coupling constraints would increase the complexity of the overall model, as they depend on the binary design variables  𝑦𝑒 . Likewise, including a set of limiting resources would also increase the complexity, as constraints (4) also depend on  𝑦𝑒 .  Finally, including geographical preparation costs into the analysis would also increase the complexity of the MIP model, as it depends on the additional binary variables 𝑧𝑠 . Then, from the previous line of reasoning, we can conclude that the full INDP-MIP model, which considers interdependence between networks and also geographical preparation costs related to binary variables  𝑧𝑠 , would be in general NP-hard.  Nevertheless, the average computational complexity of the INDP-MIP model could be improved by applying enhancement techniques based on the previously mentioned structure and properties. For example, Benders decomposition (Benders 1962; Poss 2011), could solve for the binary design variables separately from the flow variables.  Also, Dantzig-Wolfe decomposition (Dantzig et al. 1979) could be used to solve the coupling constraints (in this case the ones related to interdependence) separately from the uncoupled constraints. Then, even though the INDP-MIP model is NP-hard in its full form, it could be highly enhanced to be computationally tractable for practical scenarios. 3.1. Numerical study on the complexity of the INDP-MIP model  The structure and computational complexity of the INDP-MIP model are highly dependent on certain parameters, such as the probability of failure, the size of the system, the level of interdependency between networks, and the availability of resources.  In particular, we study the behavior of the INDP-MIP model running time, as a function of the following analysis parameters:  Failure probabilities: The more components are initially destroyed, the larger the number of constraints, since constraints (5) and (6) are defined for each destroyed component. Also, 12th International Conference on Applications of Statistics and Probability in Civil Engineering, ICASP12 Vancouver, Canada, July 12-15, 2015  5 the more destroyed components, the more terms related to binary variables in the objective function and in constraints (6).  Nodes in the system of networks: The number of nodes studied determine the number of variables and equations considered, independently of the type of constraints.  Links density: This term is defined as the ratio between the number of links in the system, and the maximum number of links for the studied network topology. The more links, the larger the number of flow variables.  Interdependency density: This term is defined as the ratio between the components that depend on other components, and the total number of components in the system. The more dependent components, the larger the amount of constraints (5).  Interdependency strength: This term is related to constraints (5), and refers to the average number of support components per dependent element. The more support components there are, the easier to enable the functionality of dependent components.  Resource availability: Lower availability of resources imply less components that can be recovered. Then, it is expected that the less resources the more difficult to find the optimal recovery strategy.  The study that follows assumes that there is a given system of interdependent networks, with fully defined sets and parameters according to the INDP-MIP formulation. Then, the exploration consists of varying each of the mentioned analysis parameters, such that it is possible to measure their impact on computational complexity and associated running times. 4. COMPUTATIONAL EXPERIMENTS In order to obtain generalizable conclusions about the INDP computational complexity, this study does not focus on a single particular case, but studies different idealized topologies, some of which constitute the building blocks of realistic systems. In particular, this analysis focuses on the study of a multilayered system of two interdependent networks, with similar sizes and topologies. We selected three different topologies:  Grid: Frequently found substrate in city-level transportation and utilities distribution networks.   Wheel: Topology that is studied in communication networks (Mackenzie 1966; Callander & Plott 2005), where there is one driving node connected to the others.  A wheel network with n nodes is composed by a single node connected to all nodes of a cycle of size n-1, resembling distribution within service areas.  Erdős–Rényi: Related to graphs where all the links are randomly distributed. In this particular case, we generated these networks to have the same number of links of the grid, without ensuring connectivity.  Without loss of generality, the INDP input parameters where generated according to the following uniform distributions, considering that this study is intended to be general, where no prior information about the probabilistic behavior of the parameters: 𝑏𝑒 ~ 𝑈(−10,10) ,𝑢𝑒  ~ 𝑈(0,10) , 𝑐𝑒 ~ 𝑈(1,10) , 𝑓𝑒 ~ 𝑈(1,100) , 𝑔𝑠 ~ 𝑈(1,200) ,𝑀𝑒+− = 1000 , ℎ𝑒 = 1.  Such distributions describe a system with large variability, without bias or asymmetry. The upper and lower bounds are chosen such that in average the demands and capacities have similar magnitudes. Also, such that the cost of preparing a reconstruction jobs for multiple co-located components is in average greater that the cost of repairing a single component. Note that the costs are never zero (or less), implying that all flows and repairing processes would increase the objective function. This analysis was based on a multilayered system (Boccaletti et al. 2014), where each component from one network has exactly one correspondent component in the other network. Thus, it was assumed that repairing a component implied repairing a unique space 𝑠 ∈ 𝒮  specific to each component. For all topologies, the system 12th International Conference on Applications of Statistics and Probability in Civil Engineering, ICASP12 Vancouver, Canada, July 12-15, 2015  6 analyzed had the following default analysis parameters: Failure probabilities = 0.5, order of the system = 32 nodes, links density = 0.5, interdependency density = 0.5, interdependency strength = 0.5, and resource availability = 6 units. We used 1000 Monte-Carlo simulations per configuration, such that the mean running time of a system with default parameters had an interval of ±1.3 milliseconds, with 95% confidence. To give a sense of the proportion of constraints and variables of each type in an average system, Figure 1 shows the matrix representations of the INDP constraints for a sample of each of the studied topologies. Observe that these matrices have almost identical sizes and structure, implying that the INDP-MIP model does not depend strongly on the topology of the studied networks, as long as the size and order of the networks are similar. For the Erdős–Rényi topology, there are 467 constraints and 412 variables in total. The set of constraints (2) has 32 equations (rows 1-32), constraints (3) has 360 inequalities (rows 33-392), constraint (4) has one inequality (row 393), constraints (5) has 11 inequalities (rows 394 to 404), and constraints (6) has 63 inequalities (rows 405 to 467). Regarding the variables, for network 1 there are 60 flow variables (columns 1-60), 76 binary design variables (columns 61-136), and 32 variables for unmet demand (columns 137-168). Similarly, for network 2 there are 60 flow variables (columns 169-228), 76 binary design variables (columns 229-304), and 32 variables for unmet demand (columns 305-336). Finally, there are 76 spaces to be prepared (columns 337-412).    Figure 1. INDP coefficient matrices for the studied topologies, with standard configuration   Figure 2 shows the running times for the studied topologies as a function of the failure probabilities. As expected, the mean running times increased with the probability of failure. Nevertheless, such increment appears to be linear. Similarly, the running times variability is also higher for larger failure probabilities. This was expected, as the probability of failure is directly linked with the number of destroyed components.  Similarly, Figure 3 shows the mean running times for diverse system sizes. As predicted, the times (and their variability) increase linearly with size. Figure 4 shows that, contrary to what one could expect, the link density of the undestroyed system appears to have no major impact on the running times. This is explained by the fact that the constraints that include binary variables (which are the ones that drive most of the complexity) are related not to the number of links, but to the number of destroyed links and nodes.    Figure 2: Mean running times and standard deviations as a function of failure probability    Figure 3: Mean running times and standard deviations as a function of the number of nodes in the system of networks    Figure 4: Mean running times and standard deviations as a function of link density (with respect to the original topology) 0 200020400VariablesConstraintsGrid0 200 4000200400VariablesConstraints Wheel0 200 400 6000200400600800VariablesConstraintsErd}os-R4enye0 0.5 probabilitytime (s)Mean0 0.5 probabilitytime (s)St.Dev.  GridWheelErd}os-R4enye0 50 10000.050 10.150 225N. of nodestime (s)Mean0 50 10000.020.040.06N. of nodestime (s)St.Dev.  GridWheelErd}os-R4enye0 .5 Densitytime (s)Mean0 0.5 10.0150.020.0250.030.0354Links Densitytime (s)St.Dev.  GridWheelErd}os-R4enye12th International Conference on Applications of Statistics and Probability in Civil Engineering, ICASP12 Vancouver, Canada, July 12-15, 2015  7 Figure 5 shows that the larger the interdependency density, the larger the running time. This was also expected, as the interdependency density determined the number of constraints related to the physical interdependence. Similarly, Figure 6 shows that the running times tend to increase with the interdependency strength. Nevertheless, observe that the change virtually does not exist for the grid topology. Such a behavior is related to the resilience of the system, since the grid topology is in general highly redundant, whereas the other topologies may get disconnected easier due to failing components.     Figure 5: Mean running times and standard deviations as a function of interdependency density   Figure 6: Mean running times as a function of interdependency strength   Figure 7: Mean running times and standard deviations as a function of the resource availability  Finally, Figure 7 shows that the running times highly depend on the resource availability. Nevertheless, as opposed to the other scenarios, the relation between the running times and the analysis parameter is not monotonic. In this case, the complexity increases vastly as the resources increase, but only for resource levels up to a value of approximately six. From that value, the running times slightly decrease with the resource availability. This is a most interesting behavior, related to the ratio between the available resources 𝑣𝑟 and the resource consumption ℎ𝑒𝑟. Given that ℎ𝑒𝑟was assumed to be one in this experiment, 𝑣𝑟 could be traduced as the number of components that could be fixed. Note that to fix one link that is dependent on another, you need to ensure functionality of at least the parent link with its starting and ending nodes, and the dependent link with its starting and ending nodes. This corresponds to six components, which is precisely the found threshold.  In general, it was possible to observe that the time-complexity of the INDP-MIP model increased with the size of the networks, the density and strength of interdependencies, the resource availability (when resources are too limited), and the probability of failure. Nevertheless, it was possible to observe that the time-complexity was independent from the studied topology, except when studying the interdependency strength, where a less reliable topology implied a larger negative impact on the running times. 5. CONCLUSIONS This paper proposed an MIP re-formulation for the Interdependent Network Design Problem (INDP) (González et al. 2014), which seeks the optimal recovery strategy for a partially destroyed system of physically and geographically interdependent networks. Even though the INDP is NP-hard, the paper shows that the INDP can be seen as a generalized version of the Minimum Cost Flow Problem (MCFP), which itself can be solved in polynomial time.  However, INDP is also a generalization of the classical Network Design Problem (NDP), which is NP-complete. Thus, algorithmic enhancement techniques such as Dantzig-Wolfe and Benders decompositions are applicable, although an understanding of the 0 0.5 t rdep. Densitytime (s)Mean0 0.5 10.0150.020.0250.03Interdep. Densitytime (s)St.Dev.  GridWheelErd}os-R4enye0 0.5 terdep. Strengthtime (s)Mean0 0.5 10.0150.020.0250.030.0350.04Interdep. Strengthtime (s)St.Dev.  GridWheelErd}os-R4enye0 10 it d resourcestime (s)Mean0 10 2000.0240.06. 8Limited resourcestime (s)St.Dev.  GridWheelErd}os-R4enye12th International Conference on Applications of Statistics and Probability in Civil Engineering, ICASP12 Vancouver, Canada, July 12-15, 2015  8 problem objective function and the structure of constraints is of paramount importance first.  Using numerical approaches, this study explores the structure of the INPD-MIP model, and shows that its time efficiency is sensitive to the size of the network, and the probabilities of failure of individual components. High levels of interdependency between networks also showed to have a major impact, but mostly for systems that have little connectivity redundancy. Similarly, using low resource availability showed to highly reduce the time complexity of the INDP-MIP model. From studying different topologies, it was possible to observe that the reliability of the studied system does not impact the behavior of the INDP-MIP model running times, except when studying different interdependency strengths. In this case, the more reliable the system, the less the influence of the interdependency strength. A similar study should be performed for real infrastructure systems under hazard events. Similarly, it is desirable implement improved solution techniques to practical decision support and resilience analyses.  ACKNOWLEDGEMENTS This publication was partially funded by “Research Program 2012” Grant from the Office of the Vice President for Research - Universidad de los Andes (Bogotá, Colombia). The authors also gratefully acknowledge the support by the U.S. Department of Defense (Grant W911NF-13-1-0340), and FICO for providing the Xpress-MP licenses used in the computational experiments.  6. REFERENCES Benders, J.F., 1962. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4(1), pp.238–252. Boccaletti, S., Bianconi, G., Criado, R., del Genio, C.I., et al., 2014. The structure and dynamics of multilayer networks. Physics Reports, 544(1), pp.1–122. Buldyrev, S. V, Parshani, R., Paul, G., Stanley, H.E., et al., 2010. Catastrophic cascade of failures in interdependent networks. Nature, 464(7291), pp.1025–8. Callander, S. & Plott, C.R., 2005. Principles of network development and evolution: an experimental study. Journal of Public Economics, 89(8), pp.1469–1495. Dantzig, G.B., Harvey, R.P., Lansdowne, Z.F., Robinson, D.W., et al., 1979. Formulating and solving the network design problem by decomposition. Transportation Research Part B: Methodological, 13(1), pp.5–17. Dionne, R. & Florian, M., 1979. Exact and approximate algorithms for optimal network design. Networks, 9, pp.37–59. Dueñas-Osorio, L., Craig, J.I. & Goodno, B.J., 2007. Seismic response of critical interdependent networks. Earthquake engineering & structural dynamics, 36(2), pp.285–306. González, A.D., Dueñas-Osorio, L., Sánchez-Silva, M. & Medaglia, A.L., 2014. The Interdependent Network Design Problem for Infrastructure System Restoration. Submitted to Computer-Aided Civil and Infrastructure Engineering. Hamacher, H.W., Pedersen, C.R. & Ruzika, S., 2007. Multiple objective minimum cost flow problems: A review. European Journal of Operational Research, 176(3), pp.1404–1422. Johnson, D., Lenstra, J. & Kan, A., 1978. The complexity of the network design problem. Networks, 8, pp.279–285. Mackenzie, K.D., 1966. Structural centrality in communications networks. Psychometrika, 31(1), pp.17–25. Orlin, J.B., 1997. A polynomial time primal network simplex algorithm for minimum cost flows. Mathematical Programming, 78(2), pp.109–129. Ouyang, M. & Dueñas-Osorio, L., 2011. An approach to design interface topologies across interdependent urban infrastructure systems. Reliability Engineering & System Safety, 96(11), pp.1462–1473. Poss, M., 2011. Models and algorithms for network design problems. 4OR, 10(2), pp.215–216. Tomlin, J., 1966. Minimum-cost multicommodity network flows. Operations Research, pp.45–51. Vaidyanathan, B., 2010. Minimum Cost Flows. Wiley Encyclopedia of Operations, 6(v).  


Citation Scheme:


Citations by CSL (citeproc-js)

Usage Statistics



Customize your widget with the following options, then copy and paste the code below into the HTML of your page to embed this item in your website.
                            <div id="ubcOpenCollectionsWidgetDisplay">
                            <script id="ubcOpenCollectionsWidget"
                            async >
IIIF logo Our image viewer uses the IIIF 2.0 standard. To load this item in other compatible viewers, use this url:


Related Items