The State-of-the-Art Survey on Optimization Methods for Cyber-physical Networks

Cyber-Physical Systems (CPS) are increasingly complex and frequently integrated into modern societies via critical infrastructure systems, products, and services. Consequently, there is a need for reliable functionality of these complex systems under various scenarios, from physical failures due to aging, through to cyber attacks. Indeed, the development of effective strategies to restore disrupted infrastructure systems continues to be a major challenge. Hitherto, there have been an increasing number of papers evaluating cyber-physical infrastructures, yet a comprehensive review focusing on mathematical modeling and different optimization methods is still lacking. Thus, this review paper appraises the literature on optimization techniques for CPS facing disruption, to synthesize key findings on the current methods in this domain. A total of 108 relevant research papers are reviewed following an extensive assessment of all major scientific databases. The main mathematical modeling practices and optimization methods are identified for both deterministic and stochastic formulations, categorizing them based on the solution approach (exact, heuristic, meta-heuristic), objective function, and network size. We also perform keyword clustering and bibliographic coupling analyses to summarize the current research trends. Future research needs in terms of the scalability of optimization algorithms are discussed. Overall, there is a need to shift towards more scalable optimization solution algorithms, empowered by data-driven methods and machine learning, to provide reliable decision-support systems for decision-makers and practitioners

Resilience-Driven Post-Disruption Restoration of Interdependent Critical Infrastructure Systems Under Uncertainty: Modeling, Risk-Averse Optimization, and Solution Approaches

Critical infrastructure networks (CINs) are the backbone of modern societies, which depend on their continuous and proper functioning. Such infrastructure networks are subjected to different types of inevitable disruptive events which could affect their performance unpredictably and have direct socioeconomic consequences. Therefore, planning for disruptions to CINs has recently shifted from emphasizing pre-disruption phases of prevention and protection to post-disruption studies investigating the ability of critical infrastructures (CIs) to withstand disruptions and recover timely from them. However, post-disruption restoration planning often faces uncertainties associated with the required repair tasks and the accessibility of the underlying transportation network. Such challenges are often overlooked in the CIs resilience literature. Furthermore, CIs are not isolated from each other, but instead, most of them rely on one another for their proper functioning. Hence, the occurrence of a disruption in one CIN could affect other dependent CINs, leading to a more significant adverse impact on communities. Therefore, interdependencies among CINs increase the complexity associated with recovery planning after a disruptive event, making it a more challenging task for decision makers. Recognizing the inevitability of large-scale disruptions to CIs and their impacts on societies, the research objective of this work is to study the recovery of CINs following a disruptive event. Accordingly, the main contributions of the following two research components are to develop: (i) resilience-based post-disruption stochastic restoration optimization models that respect the spatial nature of CIs, (ii) a general framework for scenario-based stochastic models covering scenario generation, selection, and reduction for resilience applications, (iii) stochastic risk-related cost-based restoration modeling approaches to minimize restoration costs of a system of interdependent critical infrastructure networks (ICINs), (iv) flexible restoration strategies of ICINs under uncertainty, and (v) effective solution approaches to the proposed optimization models. The first research component considers developing two-stage risk-related stochastic programming models to schedule repair activities for a disrupted CIN to maximize the system resilience. The stochastic models are developed using a scenario-based optimization technique accounting for the uncertainties of the repair time and travel time spent on the underlying transportation network. To assess the risks associated with post-disruption scheduling plans, a conditional value-at-risk metric is incorporated into the optimization models through the scenario reduction algorithm. The proposed restoration framework is illustrated using the French RTE electric power network. The second research component studies the restoration problem for a system of ICINs following a disruptive event under uncertainty. A two-stage mean-risk stochastic restoration model is proposed to minimize the total cost associated with ICINs unsatisfied demands, repair tasks, and flow. The model assigns and schedules repair tasks to network-specific work crews with consideration of limited time and resources availability. Additionally, the model features flexible restoration strategies including a multicrew assignment for a single component and a multimodal repair setting along with the consideration of full and partial functioning and dependencies between the multi-network components. The proposed model is illustrated using the power and water networks in Shelby County, Tennessee, United States, under two hypothetical earthquakes. Finally, some other topics are discussed for possible future work

OPTIMIZATION MODELS AND METHODOLOGIES TO SUPPORT EMERGENCY PREPAREDNESS AND POST-DISASTER RESPONSE

This dissertation addresses three important optimization problems arising during the phases of pre-disaster emergency preparedness and post-disaster response in time-dependent, stochastic and dynamic environments. The first problem studied is the building evacuation problem with shared information (BEPSI), which seeks a set of evacuation routes and the assignment of evacuees to these routes with the minimum total evacuation time. The BEPSI incorporates the constraints of shared information in providing on-line instructions to evacuees and ensures that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. A mixed-integer linear program is formulated for the BEPSI and an exact technique based on Benders decomposition is proposed for its solution. Numerical experiments conducted on a mid-sized real-world example demonstrate the effectiveness of the proposed algorithm. The second problem addressed is the network resilience problem (NRP), involving an indicator of network resilience proposed to quantify the ability of a network to recover from randomly arising disruptions resulting from a disaster event. A stochastic, mixed integer program is proposed for quantifying network resilience and identifying the optimal post-event course of action to take. A solution technique based on concepts of Benders decomposition, column generation and Monte Carlo simulation is proposed. Experiments were conducted to illustrate the resilience concept and procedure for its measurement, and to assess the role of network topology in its magnitude. The last problem addressed is the urban search and rescue team deployment problem (USAR-TDP). The USAR-TDP seeks an optimal deployment of USAR teams to disaster sites, including the order of site visits, with the ultimate goal of maximizing the expected number of saved lives over the search and rescue period. A multistage stochastic program is proposed to capture problem uncertainty and dynamics. The solution technique involves the solution of a sequence of interrelated two-stage stochastic programs with recourse. A column generation-based technique is proposed for the solution of each problem instance arising as the start of each decision epoch over a time horizon. Numerical experiments conducted on an example of the 2010 Haiti earthquake are presented to illustrate the effectiveness of the proposed approach

Dissertation - Preemptive Rerouting of Airline Passengers Under Uncertain Delays

An airline\u27s operational disruptions can lead to flight delays that in turn impact passengers, not only through the delay itself but also through possible missed connections. Much research has been done on crew recovery (rescheduling crews after a flight delay or cancellation), but little research has been done on passenger reaccommodation. Our goal is to design ways that passenger reaccommodation can be improved so that passengers can spend less time delayed and miss fewer connections. Since the length of a delay is often not known in advance, we consider preemptive rerouting of airline passengers before the length of the delay is known. Our goal is to reaccommodate passengers proactively as soon as it is known that a flight will be delayed instead of waiting until passengers have missed connections and to use known probabilities for the length of delay. In addition, we consider all of the affected passengers together so that we can effectively handle passengers\u27 competition for available seats. We can give certain seats to people with short connections or those connecting to international flights. When there is one delayed flight, we model the problem as a two-stage stochastic programming problem, with first-stage decisions that assign passengers initial itineraries and second-stage decisions that re-assign any passengers who are subsequently disrupted by the delay. We present a Benders decomposition approach to solving this problem. Computational results for this model are given, showing its effectiveness for reducing the length of passenger delays. When there is more than one delayed flight, we define a portfolio model which assigns passengers to portfolios that define their itineraries under all possible disruption outcomes. We focus on computational methods for solving this model

Scheduled service network design for integrated planning of rail freight transportation

Cette thèse étudie une approche intégrant la gestion de l’horaire et la conception de réseaux de services pour le transport ferroviaire de marchandises. Le transport par rail s’articule autour d’une structure à deux niveaux de consolidation où l’affectation des wagons aux blocs ainsi que des blocs aux services représentent des décisions qui complexifient grandement la gestion des opérations. Dans cette thèse, les deux processus de consolidation ainsi que l’horaire d’exploitation sont étudiés simultanément. La résolution de ce problème permet d’identifier un plan d’exploitation rentable comprenant les politiques de blocage, le routage et l’horaire des trains, de même que l’habillage ainsi que l’affectation du traffic. Afin de décrire les différentes activités ferroviaires au niveau tactique, nous étendons le réseau physique et construisons une structure de réseau espace-temps comprenant trois couches dans lequel la dimension liée au temps prend en considération les impacts temporels sur les opérations. De plus, les opérations relatives aux trains, blocs et wagons sont décrites par différentes couches. Sur la base de cette structure de réseau, nous modélisons ce problème de planification ferroviaire comme un problème de conception de réseaux de services. Le modèle proposé se formule comme un programme mathématique en variables mixtes. Ce dernie r s’avère très difficile à résoudre en raison de la grande taille des instances traitées et de sa complexité intrinsèque. Trois versions sont étudiées : le modèle simplifié (comprenant des services directs uniquement), le modèle complet (comprenant des services directs et multi-arrêts), ainsi qu’un modèle complet à très grande échelle. Plusieurs heuristiques sont développées afin d’obtenir de bonnes solutions en des temps de calcul raisonnables. Premièrement, un cas particulier avec services directs est analysé. En considérant une cara ctéristique spécifique du problème de conception de réseaux de services directs nous développons un nouvel algorithme de recherche avec tabous. Un voisinage par cycles est privilégié à cet effet. Celui-ci est basé sur la distribution du flot circulant sur les blocs selon les cycles issus du réseau résiduel. Un algorithme basé sur l’ajustement de pente est développé pour le modèle complet, et nous proposons une nouvelle méthode, appelée recherche ellipsoidale, permettant d’améliorer davantage la qualité de la solution. La recherche ellipsoidale combine les bonnes solutions admissibles générées par l’algorithme d’ajustement de pente, et regroupe les caractéristiques des bonnes solutions afin de créer un problème élite qui est résolu de facon exacte à l’aide d’un logiciel commercial. L’heuristique tire donc avantage de la vitesse de convergence de l’algorithme d’ajustement de pente et de la qualité de solution de la recherche ellipsoidale. Les tests numériques illustrent l’efficacité de l’heuristique proposée. En outre, l’algorithme représente une alternative intéressante afin de résoudre le problème simplifié. Enfin, nous étudions le modèle complet à très grande échelle. Une heuristique hybride est développée en intégrant les idées de l’algorithme précédemment décrit et la génération de colonnes. Nous proposons une nouvelle procédure d’ajustement de pente où, par rapport à l’ancienne, seule l’approximation des couts liés aux services est considérée. La nouvelle approche d’ajustement de pente sépare ainsi les décisions associées aux blocs et aux services afin de fournir une décomposition naturelle du problème. Les résultats numériques obtenus montrent que l’algorithme est en mesure d’identifier des solutions de qualité dans un contexte visant la résolution d’instances réelles.This thesis studies a scheduled service network design problem for rail freight transportation planning. Rails follow a special two level consolidation organization, and the car-to-block, block-to-service handling procedure complicates daily operations. In this research, the two consolidation processes as well as the operation schedule are considered simultaneously, and by solving this problem, we provide an overall cost-effective operating plan, including blocking policy, train routing, scheduling, make-up policy and traffic distribution. In order to describe various rail operations at the tactical level, we extend the physical network and construct a 3-layer time-space structure, in which the time dimension takes into consideration the temporal impacts on operations. Furthermore, operations on trains, blocks, and cars are described in different layers. Based on this network structure, we model the rail planning problem to a service network design formulation. The proposed model relies on a complex mixed-integer programming formulation. The problem is very hard to solve due to the computational difficulty as well as the tremendous size of the application instances. Three versions of the problem are studied, which are the simplified model (with only non-stop services), complete model (with both non-stop and multi-stop services) and very-large-scale complete model. Heuristic algorithms are developed to provide good feasible solutions in reasonable computing efforts. A special case with non-stop services is first studied. According to a specific characteristic of the direct service network design problem, we develop a tabu search algorithm. The tabu search moves in a cycle-based neighborhood, where flows on blocks are re-distributed according to the cycles in a conceptual residual network. A slope scaling based algorithm is developed for the complete model, and we propose a new method, called ellipsoidal search, to further improve the solution quality. Ellipsoidal search combines the good feasible solutions generated from the slope scaling, and collects the features of good solutions into an elite problem, and solves it with exact solvers. The algorithm thus takes advantage of the convergence speed of slope scaling and solution quality of ellipsoidal search, and is proven effective. The algorithm also presents an alternative for solving the simplified problem. Finally, we work on the very-large-size complete model. A hybrid heuristic is developed by integrating the ideas of previous research with column generation. We propose a new slope scaling scheme where, compared with the previous scheme, only approximate service costs instead of both service and block costs are considered. The new slope scaling scheme thus separates the block decisions and service decisions, and provide a natural decomposition of the problem. Experiments show the algorithm is good to solve real-life size instances