New Routing Problems with possibly correlated travel times

In the literature of operational research, Vehicle Routing Problems (VRP) were and still are subject of countless studies. Under the scope of combinatorial optimization, this thesis analyses some variants of VRP both with deterministic and uncertain travel times. The deterministic problem under study is a drayage problem with characteristics con- cerning service types and requirement seldom investigated all together. The formulations proposed to model this problem are: the node-arc formulation and the Set Partitioning formu- lation. Concerning the solution methods, two heuristics and a branch-and-price approach are presented. The section dealing with uncertain and correlated travel times faces two classes of VRP with time windows using either single or joint chance constraints depending on whether missing a customers time window makes the entire route infeasible or not. From a comparison between deterministic and stochastic methods, these last represent a profitable investment to guarantee the feasibility of the solution in realistic instances

Planning of integrated mobility-on-demand and urban transit networks

We envision a multimodal transportation system where Mobility-on-Demand (MoD) service is used to serve the first mile and last mile of transit trips. For this purpose, the current research formulates an optimization model for designing an integrated MoD and urban transit system. The proposed model is a mixed-integer non-linear programming model that captures the strategic behavior of passengers in a multimodal network through a passenger assignment model. It determines which transit routes to operate, the frequency of the operating routes, the fleet size of vehicles required in each transportation analysis zone to serve the demand, and the passenger flow on both road and transit networks. A Benders decomposition approach with several enhancements is proposed to solve the given optimization program. Computational experiments are presented for the Sioux Falls multimodal network. The results show a significant improvement in the congestion in the city center with the introduction and optimization of an integrated transportation system. The proposed design allocates more vehicles to the outskirt zones in the network (to serve the first mile and last mile of transit trips) and more frequency to the transit routes in the city center. The integrated system significantly improves the share of transit passengers and their level of service in comparison to the base optimized transit system. The sensitivity analysis of the bus and vehicle fleet shows that increasing the number of buses has more impact on improving the level of service of passengers compared to increasing the number of MoD vehicles. Finally, we provide managerial insights for deploying such multimodal service.Comment: 39 pages, 6 figure

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