Assessing the reliability of multistate flow networks considering distance constraints

Evaluating the reliability of complex technical networks, such as those in energy distribution, logistics, and transportation systems, is of paramount importance. These networks are often represented as multistate flow networks (MFNs). While there has been considerable research on assessing MFN reliability, many studies still need to pay more attention to a critical factor: transmission distance constraints. These constraints are typical in real-world applications, such as Internet infrastructure, where controlling the distances between data centers, network nodes, and end-users is vital for ensuring low latency and efficient data transmission. This paper addresses the evaluation of MFN reliability under distance constraints. Specifically, it focuses on determining the probability that a minimum of $d$ flow units can be transmitted successfully from a source node to a sink node, using only paths with lengths not exceeding a predefined distance limit of $\lambda$. We introduce an effective algorithm to tackle this challenge, provide a benchmark example to illustrate its application and analyze its computational complexity

Doctor of Philosophy

dissertationA safe and secure transportation system is critical to providing protection to those who employ it. Safety is being increasingly demanded within the transportation system and transportation facilities and services will need to adapt to change to provide it. This dissertation provides innovate methodologies to identify current shortcomings and provide theoretic frameworks for enhancing the safety and security of the transportation network. This dissertation is designed to provide multilevel enhanced safety and security within the transportation network by providing methodologies to identify, monitor, and control major hazards associated within the transportation network. The risks specifically addressed are: (1) enhancing nuclear materials sensor networks to better deter and interdict smugglers, (2) use game theory as an interdiction model to design better sensor networks and forensically track smugglers, (3) incorporate safety into regional transportation planning to provide decision-makers a basis for choosing safety design alternatives, and (4) use a simplified car-following model that can incorporate errors to predict situational-dependent safety effects of distracted driving in an ITS infrastructure to deploy live-saving countermeasures

Reliability Modeling and Improvement of Critical Infrastructures: Theory, Simulation, and Computational Methods

This dissertation presents a framework for developing data-driven tools to model and improve the performance of Interconnected Critical Infrastructures (ICIs) in multiple contexts. The importance of ICIs for daily human activities and the large volumes of data in continuous generation in modern industries grant relevance to research efforts in this direction. Chapter 2 focuses on the impact of disruptions in Multimodal Transportation Networks, which I explored from an application perspective. The outlined research directions propose exploring the combination of simulation for decision-making with data-driven optimization paradigms to create tools that may provide stakeholders with optimal policies for a wide array of scenarios and conditions. The flexibility of the developed simulation models, in combination with cutting-edge technologies, such as Deep Reinforcement Learning (DRL), sets the foundation for promising research efforts on the performance, analysis, and optimization of Inland Waterway Transportation Systems. Chapter 3 explores data-driven models for condition monitoring and prognostics, with a focus on using Deep Learning (DL) to predict the Remaining Useful Life of turbofan engines based on sequential sensor measurements. A myriad of approaches exist for this type of problems, and the main contribution for future efforts might be centered around combining this type of data-driven methods with simulation tools and computational methods in the context of network resilience optimization. Chapter 4 revolves around developing data-driven methods for estimating all-terminal reliability of networks with arbitrary structures and outlines research directions for data-driven surrogate models. Furthermore, the use of DRL for network design optimization and maximizing all-terminal network reliability is presented. This poses a promising research venue that has been extended to network reliability problems involving dynamic decision-making on allocating new resources, maintaining and/or improving the edges already in the network, or repairing failed edges due to aging. The outlined research presents various data-driven tools developed to collaborate in the context of modeling and improvement for Critical Infrastructures. Multiple research venues have been intertwined by combining various paradigms and methods to achieve this goal. The final product is a line of research focused on reliability estimation, design optimization, and prognostics and health management for ICIs, by combining computational methods and theory

Modeling and Optimization of Resource Allocation in Supply Chain Management Problems

Resource allocation in supply chain management studies how to allocate the limited available resources economically/optimally to satisfy the demands. It is an important research area in operations research. This dissertation focuses on the modeling and optimization of three problems. The first part of the dissertation investigates an important and unique problem in a supply chain distribution network, namely minimum cost network flow with variable lower bounds (MCNF-VLB). This type of network can be used to optimize the utilization of distribution channels (i.e., resources) in a large supply network, in order to minimize the total cost while satisfying flow conservation, lower and upper bounds, and demand/supply constraints. The second part of the dissertation introduces a novel method adopted from multi-product inventory control to optimally allocate the cache space and the frequency (i.e., resources) for multi-stream data prefetching in computer science. The objective is to minimize the cache miss level (backorder level), while satisfying the cache space (inventory space) and the total prefetching frequency (total order frequency) constraints. Also, efforts have also been made to extend the model for a multi-level, multi-stream prefetching system. The third part of the dissertation studies the joint capacity (i.e., resources) and demand allocation problem in a service delivery network. The objective is to minimize the total cost while satisfying a required service reliability, which measures the probability of satisfying customer demand within a delivery time interval

A contribution to the evaluation and optimization of networks reliability

L’évaluation de la fiabilité des réseaux est un problème combinatoire très complexe qui nécessite des moyens de calcul très puissants. Plusieurs méthodes ont été proposées dans la littérature pour apporter des solutions. Certaines ont été programmées dont notamment les méthodes d’énumération des ensembles minimaux et la factorisation, et d’autres sont restées à l’état de simples théories. Cette thèse traite le cas de l’évaluation et l’optimisation de la fiabilité des réseaux. Plusieurs problèmes ont été abordés dont notamment la mise au point d’une méthodologie pour la modélisation des réseaux en vue de l’évaluation de leur fiabilités. Cette méthodologie a été validée dans le cadre d’un réseau de radio communication étendu implanté récemment pour couvrir les besoins de toute la province québécoise. Plusieurs algorithmes ont aussi été établis pour générer les chemins et les coupes minimales pour un réseau donné. La génération des chemins et des coupes constitue une contribution importante dans le processus d’évaluation et d’optimisation de la fiabilité. Ces algorithmes ont permis de traiter de manière rapide et efficace plusieurs réseaux tests ainsi que le réseau de radio communication provincial. Ils ont été par la suite exploités pour évaluer la fiabilité grâce à une méthode basée sur les diagrammes de décision binaire. Plusieurs contributions théoriques ont aussi permis de mettre en place une solution exacte de la fiabilité des réseaux stochastiques imparfaits dans le cadre des méthodes de factorisation. A partir de cette recherche plusieurs outils ont été programmés pour évaluer et optimiser la fiabilité des réseaux. Les résultats obtenus montrent clairement un gain significatif en temps d’exécution et en espace de mémoire utilisé par rapport à beaucoup d’autres implémentations. Mots-clés: Fiabilité, réseaux, optimisation, diagrammes de décision binaire, ensembles des chemins et coupes minimales, algorithmes, indicateur de Birnbaum, systèmes de radio télécommunication, programmes.Efficient computation of systems reliability is required in many sensitive networks. Despite the increased efficiency of computers and the proliferation of algorithms, the problem of finding good and quickly solutions in the case of large systems remains open. Recently, efficient computation techniques have been recognized as significant advances to solve the problem during a reasonable period of time. However, they are applicable to a special category of networks and more efforts still necessary to generalize a unified method giving exact solution. Assessing the reliability of networks is a very complex combinatorial problem which requires powerful computing resources. Several methods have been proposed in the literature. Some have been implemented including minimal sets enumeration and factoring methods, and others remained as simple theories. This thesis treats the case of networks reliability evaluation and optimization. Several issues were discussed including the development of a methodology for modeling networks and evaluating their reliabilities. This methodology was validated as part of a radio communication network project. In this work, some algorithms have been developed to generate minimal paths and cuts for a given network. The generation of paths and cuts is an important contribution in the process of networks reliability and optimization. These algorithms have been subsequently used to assess reliability by a method based on binary decision diagrams. Several theoretical contributions have been proposed and helped to establish an exact solution of the stochastic networks reliability in which edges and nodes are subject to failure using factoring decomposition theorem. From this research activity, several tools have been implemented and results clearly show a significant gain in time execution and memory space used by comparison to many other implementations. Key-words: Reliability, Networks, optimization, binary decision diagrams, minimal paths set and cuts set, algorithms, Birnbaum performance index, Networks, radio-telecommunication systems, programs

Design and Analysis of Efficient Freight Transportation Networks in a Collaborative Logistics Environment

The increase in total freight volumes, reducing volume per freight unit, and delivery deadlines have increased the burden on freight transportation systems of today. With the evolution of freight demand trends, there also needs to be an evolution in the freight distribution processes. Today\u27s freight transportation processes have a lot of inefficiencies that could be streamlined, thus preventing concerns like increased operational costs, road congestion, and environmental degradation. Collaborative logistics is one of the approaches where supply chain partners collaborate horizontally or/and vertically to create a centralized network that is more efficient and serves towards a common goal or objective. In this dissertation, we study intermodal transportation, and cross-docking, two major pillars of efficient, cheap, and faster freight transportation in a collaborative environment. We design an intermodal network from a centralized network perspective where all the participants intermodal operators, shippers, carriers, and customers strive towards a synchronized and cost-efficient freight network. Also, a cross-dock scheduling problem is presented for competitive shippers using a centralized cross-dock facility. The problem develops a fast heuristic and meta-heuristic approach to solve large-scale real-world problems and draws key insights from a cross-dock operator and inbound carrier\u27s perspectives

Optimization of vehicle routing and scheduling with travel time variability - application in winter road maintenance

This study developed a mathematical model for optimizing vehicle routing and scheduling, which can be used to collect travel time information, and also to perform winter road maintenance operations (e.g., salting, plowing). The objective of this research was to minimize the total vehicle travel time to complete a given set of service tasks, subject to resource constraints (e.g., truck capacity, fleet size) and operational constraints (e.g., service time windows, service time limit). The nature of the problem is to design vehicle routes and schedules to perform the required service on predetermined road segments, which can be interpreted as an arc routing problem (ARP). By using a network transformation technique, an ARP can be transformed into a well-studied node routing problem (NRP). A set-partitioning (SP) approach was introduced to formulate the problem into an integer programming problem (I PP). To solve this problem, firstly, a number of feasible routes were generated, subject to resources and operational constraints. A genetic algorithm based heuristic was developed to improve the efficiency of generating feasible routes. Secondly, the corresponding travel time of each route was computed. Finally, the feasible routes were entered into the linear programming solver (CPL EX) to obtain final optimized results. The impact of travel time variability on vehicle routing and scheduling for transportation planning was also considered in this study. Usually in the concern of vehicle and pedestrian\u27s safety, federal, state governments and local agencies are more leaning towards using a conservative approach with constant travel time for the planning of winter roadway maintenance than an aggressive approach, which means that they would rather have a redundancy of plow trucks than a shortage. The proposed model and solution algorithm were validated with an empirical case study of 41 snow sections in the northwest area of New Jersey. Comprehensive analysis based on a deterministic travel time setting and a time-dependent travel time setting were both performed. The results show that a model that includes time dependent travel time produces better results than travel time being underestimated and being overestimated in transportation planning. In addition, a scenario-based analysis suggests that the current NJDOT operation based on given snow sector design, service routes and fleet size can be improved by the proposed model that considers time dependent travel time and the geometry of the road network to optimize vehicle routing and scheduling. In general, the benefit of better routing and scheduling design for snow plowing could be reflected in smaller minimum required fleet size and shorter total vehicle travel time. The depot location and number of service routes also have an impact on the final optimized results. This suggests that managers should consider the depot location, vehicle fleet sizing and the routing design problem simultaneously at the planning stage to minimize the total cost for snow plowing operations

RESILIENCE OF TRANSPORTATION INFRASTRUCTURE SYSTEMS: QUANTIFICATION AND OPTIMIZATION

Transportation systems are critical lifelines for society, but are at risk from natural or human-caused hazards. To prevent significant loss from disaster events caused by such hazards, the transportation system must be resilient, and thus able to cope with disaster impact. It is impractical to reinforce or harden these systems to all types of events. However, options that support quick recovery of these systems and increase the system's resilience to such events may be helpful. To address these challenges, this dissertation provides a general mathematical framework to protect transportation infrastructure systems in the presence of uncertain events with the potential to reduce system capacity/performance. A single, general decision-support optimization model is formulated as a multi-stage stochastic program. The program seeks an optimal sequence of decisions over time based upon the realization of random events in each time stage. This dissertation addresses three problems to demonstrate the application of the proposed mathematical model in different transportation environments with emphasis on system-level resilience: Airport Resilience Problem (ARP), Building Evacuation Design Problem (BEDP), and Travel Time Resilience in Roadways (TTR). These problems aim to measure system performance given the system's topological and operational characteristics and support operational decision-making, mitigation and preparedness planning, and post-event immediate response. Mathematical optimization techniques including, bi-level programming, nonlinear programming, stochastic programming and robust optimization, are employed in the formulation of each problem. Exact (or approximate) solution methodologies based on concepts of primal and dual decomposition (integer L-shaped decomposition, Generalized Benders decomposition, and progressive hedging), disjunctive optimization, scenario simulation, and piecewise linearization methods are presented. Numerical experiments were conducted on network representations of a United States rail-based intermodal container network, the LaGuardia Airport taxiway and runway pavement network, a single-story office building, and a small roadway network