Civil & Environmental Engineering Theses and Dissertations
Permanent URI for this collectionhttp://hdl.handle.net/1903/2753
Browse
2 results
Search Results
Item ENHANCING RESILIENCE OF COMPLEX NETWORKS: WASHINGTON D.C. URBAN RAIL TRANSIT AS A CASE STUDY(2020) Saadat, Yalda; Ayyub, Bilal BA; Civil Engineering; Digital Repository at the University of Maryland; University of Maryland (College Park, Md.)According to the United Nation’s Department of Economic and Social Affairs Population Division, 66% of the world’s population will reside in urban areas by 2050; a boost from 30 % in 1950. Urbanization has indeed triumphed and its speed has brought innovation and economic growth. Its synergies within infrastructure systems are undeniable and have increased the demand for such systems. However, urbanization is one reason infrastructure systems are knocked out of equilibrium and show complex dynamical behavior. Most infrastructure systems have been designed without planning for this magnitude of potential demographic changes; thus redesigns are long overdue. Also, climate change looms. Resource scarcity and host of other factors leave their impacts; all pose some incidence of perturbation in the state of the infrastructure system. These perturbations can affect the system’s resilience, which is a defining property of each system for remaining functional in the midst of disruption from an adverse event. Therefore, it is essential to develop appropriate metrics and methods to enhance the resilience of infrastructures at the network level. Such enhancements are critical for sustainable infrastructure development that is capable of performing satisfactorily through intentional and/or stochastic disruptions. A resilience evaluation of a network typically entails assessing vulnerability and robustness as well as identifying strategies to increasing network efficiency and performance and offering recovery strategies ideally taken in a cost-effective manner. This dissertation uses complex network theory (CNT) as the theoretic basis to enhance the resilience of large-scale infrastructure networks, such as urban rail transit systems. Urban rail transit infrastructures are heterogeneous, complex systems consisting of a large number of interacting nodes and links, which can imitate a network paradigm. Any adverse event leading to a disruption in the interaction and connectivity of network components would dramatically affect the safety and wellbeing of commuters, as well as the direct and indirect costs associated with performance loss. Therefore, enhancing their resilience is necessary. Using the Washington D.C. Urban rail transit as a case study, this dissertation develops a methodology to analyze network topology, compute its efficiency, vulnerability, and robustness in addition to provide a unified metric for assessing the network resilience. The steps of methodology are applied to two models of weighted and unweighted networks. For the weighted model two novel algorithms are proposed to capture the general pattern of ridership in the network, and to reflect the weights on assessing network efficiency, respectively. This dissertation then proposes an effective strategy to increase the network resilience prior to a disruptive event, e.g., a natural disaster, by adding several loop lines in the network for topological enhancement. As such, adding a loop line can create redundancy to the vulnerable components and improve network resilience. Expanding on this, the dissertation offers comparative recovery strategies and cost model in the case of disruption. An effective recovery strategy must demonstrate rapid optimal restoration of a disrupted system performance while minimizing recovery costs. In summary, the systematic methodology described above, assesses and enhances the network resilience. The initial results rank the most vulnerable and robust components of the network. The algorithms developed throughout the study advance the weighted network analysis state of art. The topological enhancement strategy offered basis to justify capital improvement. Post failure recovery analysis and the cost model serves to inform decision makers in identifying best recover strategies with special attention not only to restoring performance of a system but also on reducing associated failure and recovery costs. The use of the methodology proposed in this dissertation may lead to significant societal benefits by reducing the risk of catastrophic failures, providing references for mitigation of disruption due to adverse events, and offering resilience- based strategies, and related pursuits.Item On finding paths and flows in multicriteria, stochastic and time-varying networks(2004-11-24) Opasanon, Sathaporn -; Miller-Hooks, Elise; Civil Engineering; Digital Repository at the University of Maryland; University of Maryland (College Park, Md.)This dissertation addresses two classes of network flow problems in networks with multiple, stochastic and time-varying attributes. The first problem class is concerned with providing routing instructions with the ability to make updated decisions as information about travel conditions is revealed for individual travelers in a transportation network. Three exact algorithms are presented for identifying all or a subset of the adaptive Pareto-optimal solutions with respect to the expected value of each criterion from each node to a desired destination for each departure time in the period of interest. The second problem class is concerned with problems of determining the optimal set of a priori path flows for evacuation in capacitated networks are addressed, where the time-dependent and stochastic nature of arc attributes and capacities inherent in these problems is explicitly considered. The concept of Safest Escape is formulated for developing egress instructions. An exact algorithm is proposed to determine the pattern of flow that maximizes the minimum path probability of successful arrival of supply at the sink. While the Safest Escape problem considers stochastic, time-varying capacities, arc travel times, while time-varying, are deterministic quantities. Explicit consideration of stochastic and time-varying travel times makes the SEscape problem and other related problems significantly more difficult. A meta-heuristic based on the principles of genetic algorithms is developed for determining optimal path flows with respect to several problems in dynamic networks, where arc traversal times and capacities are random variables with probability mass functions that vary with time. The proposed genetic algorithm is extended for use in more difficult, stochastic, time-varying and multicriteria, capacitated networks, for which no exact, efficient algorithms exist. Several objectives may be simultaneously considered in determining the optimal flow pattern: minimize total time, maximize expected flow and maximize the minimum path probability of successful arrival at the sink (the objective of the SEscape problem). Numerical experiments are conducted to assess the performance of all proposed approaches.