Mathematical Programming Algorithms for Reliable Routing and Robust Evacuation Problems

Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be present to retain some measure of expected functionality. We first briefly consider the reliability-constrained single-path problem, where we look for the lowest cost path that meets a reliability side constraint. This analysis enables us to then examine the reliability-constrained two-path problem, which seeks to establish two minimum-cost paths between a source and destination node wherein at least one path must remain fully operable with some threshold probability. We consider the case in which both paths must be arc-disjoint and the case in which arcs can be shared between the paths. We prove both problems to be NP-hard. We examine strategies for solving the resulting nonlinear integer program, including pruning, coefficient tightening, lifting, and branch-and-bound partitioning schemes. Next, we consider the reliable h-path routing problem, which seeks a minimum-cost set of h ≥ 2 arc-independent paths between a source and destination node, such that the probability that at least one path remains operational is sufficiently large. Our prior arc-based models and algorithms tailored for the case in which h = 2 do not extend well to the general h-path problem. Thus, we propose two alternative integer programming formulations for the h-path problem in which the variables correspond to origin-destination paths. We propose two branch-and-price-and-cut algorithms for solving these new formulations, and provide computational results to demonstrate the efficiency of these algorithms. Finally, we examine the robust design of an evacuation tree, in which evacuation is subject to capacity restrictions on arcs. Given a discrete set of disaster scenarios with varying network populations, arc capacities, transit times, and time-dependent penalty functions, we seek to establish an optimal a priori evacuation tree that minimizes the expected evacuation penalty. The solution strategy is based on Benders decomposition, and we provide effcient methods for obtaining primal and dual sub-problem solutions. We analyze techniques for strengthening the master problem formulation, thus reducing the number of master problem solutions required for the algorithm's convergence