Hub location and vehicle routing problem under uncertainty

The hub location and vehicle routing problem involve finding the location of hub facilities, allocating the demand nodes to these hub facilities and forming the routes of the vehicles. We first consider "The Single Allocation p-hub Center and Vehicle Routing Problem", which seeks to design a network where the maximum time/distance between any origin-destination pair in the network is minimized. In this thesis, we relax one of the main assumptions in the hub location literature that one vehicle has to operate between each demand center and hub. In hub location and vehicle routing decisions, travel times are usually determined by ignoring traffic congestion. Therefore, incorporating uncertainty into hub location and routing is crucial for achieving a reliable hub network design. In this thesis, we focus on the "Robust p-hub Center and Vehicle Routing Problem", which employs a two-stage robust programming formulation, that addresses the possibility of unavailable components or transmission delays in the network. The proposed two mathematical models are tested on the various instances on the Turkish network and CAB datasets. Keywords:Hub Location Problems, p-Hub Center Problem, Vehicle Routing, Robust Programming, Two-Stage Formulation.