TY - JOUR

T1 - A stochastic multi-period capacitated multiple allocation hub location problem

T2 - Formulation and inequalities

AU - Correia, Isabel

AU - Nickel, Stefan

AU - Saldanha-da-Gama, Francisco

N1 - Sem pdf conforme despacho.
info:eu-repo/grantAgreement/FCT/5876/147204/PT#
info:eu-repo/grantAgreement/FCT/5876/147209/PT#

PY - 2018/1/1

Y1 - 2018/1/1

N2 - This study focuses on the development of a modeling framework for multi-period stochastic capacitated multiple allocation hub location problems. We consider a planning horizon divided into several time periods. Uncertainty is assumed for the demands. The decisions to make concern the location of the hubs, their initial capacity, the capacity expansion of existing hubs and the transportation between origin–destination pairs. The goal is to minimize the total expected cost. For the situation in which uncertainty can be captured by a finite set of scenarios each occurring with some estimated probability we derive the extensive form of the deterministic equivalent. The resulting model is compact. However, it includes a set of binary variables that becomes too large for medium and large instances of the problem and thus hardly can it be tackled by a general optimization solver. For this reason, enhancements are proposed to the model making it possible to solve optimally instances that could not be solved using the initial model. This is confirmed by the computational tests performed using the well-known CAB data.

AB - This study focuses on the development of a modeling framework for multi-period stochastic capacitated multiple allocation hub location problems. We consider a planning horizon divided into several time periods. Uncertainty is assumed for the demands. The decisions to make concern the location of the hubs, their initial capacity, the capacity expansion of existing hubs and the transportation between origin–destination pairs. The goal is to minimize the total expected cost. For the situation in which uncertainty can be captured by a finite set of scenarios each occurring with some estimated probability we derive the extensive form of the deterministic equivalent. The resulting model is compact. However, it includes a set of binary variables that becomes too large for medium and large instances of the problem and thus hardly can it be tackled by a general optimization solver. For this reason, enhancements are proposed to the model making it possible to solve optimally instances that could not be solved using the initial model. This is confirmed by the computational tests performed using the well-known CAB data.

KW - Hub location

KW - Stochastic programming

KW - Valid inequalities

UR - http://www.scopus.com/inward/record.url?scp=85014023198&partnerID=8YFLogxK

U2 - 10.1016/j.omega.2017.01.011

DO - 10.1016/j.omega.2017.01.011

M3 - Article

AN - SCOPUS:85014023198

VL - 74

SP - 122

EP - 134

JO - Omega (United Kingdom)

JF - Omega (United Kingdom)

SN - 0305-0483

ER -