Robust p-Hub Problem Non-Capable Multi-Allocation Center with Cost Uncertainty

This paper addresses the $p$-Hub Non-Capacitated Multi-Assignment Problem under uncertainty, aiming to determine the location of $p$ hubs and the routing of flows between origin-destination pairs that minimize the maximum transportation cost while accounting for uncertainty in transportation costs. Three robust optimization approaches based on a discrete set of scenarios are adopted. Computational experiments with standard instances from the literature indicate that the consideration of uncertainty significantly impacts both the value of the objective function and the configuration of the hub network. The results show that the robust approaches produce more resilient solutions, which may result in an increase or decrease in the maximum cost compared to the deterministic model, depending on the instance analyzed.