Reliable single-allocation hub location problem with disruptions

Hub transportation networks are vulnerable to uncertainties such as natural disasters or terrorist attacks. We investigate the single-allocation p-hub location problems and the effect of uncertainties on deliveries. We introduce a bi-objective reliable capacitated p-hub location model considering hubs and links uncertainties to minimize both the total cost and the maximum transportation time. An efficient approximation approach is proposed to provide a lower bound for the optimal Pareto-frontier. We develop a new hybrid meta-heuristic algorithm to solve the model to near optimality. Our modelling and analysis of France transportation network shows that cost and delivery performance could be significantly improved.