Highlights We consider three variants of robust hub location. This study is the first to consider both uncertain demand and transportation cost. We introduce appropriate formulations and a solution algorithm. Results provide insight in the nature of robust and stochastic solutions.
Abstract In this paper we present robust counterparts for uncapacitated hub location problems in which the level of conservatism can be controlled by means of a budget of uncertainty. We study three particular cases for which the parameters are subject to interval uncertainty: demand, transportation cost, and both simultaneously. We present mixed integer programming formulations for each of these cases and a branch-and-cut algorithm to solve the latter. We present computational results to evaluate the performance of the proposed formulations when solved with a general purpose solver and study the structure of the solutions to each of the robust counterparts. We also compare the performance between solutions obtained from a commensurable stochastic model and those from our robust counterparts in both risk neutral and worst-case settings.
Robust uncapacitated hub location
Transportation Research Part B: Methodological ; 106 ; 393-410
2017-06-12
18 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
The Dynamic Uncapacitated Hub Location Problem
British Library Online Contents | 2011
|The Dynamic Uncapacitated Hub Location Problem
Online Contents | 2011
|Uncapacitated Facility Location with Allocation of Matched and Unmatched Clients
British Library Conference Proceedings | 1997
|The minimum information approach to the uncapacitated p-median facility location problem
Taylor & Francis Verlag | 2022
|Attaining a good primal solution to the uncapacitated transportation problem
DOAJ | 2022
|