TY - JOUR
T1 - Modeling the shelter site location problem using chance constraints: a case study for Istanbul
AU - Kınay, Ömer Burak
AU - Yetis Kara, Bahar
AU - Saldanha-da-Gama, Francisco
AU - Correia, Isabel
N1 - This research has been partially supported by the Turkish Academy of Sciences and by the Portuguese Science Foundation, projects UID/MAT/04561/2013 (CMAF-CIO/FCUL) and UID/MAT/00297/2013 (CMA/FCT/UNL).
PY - 2018/10/1
Y1 - 2018/10/1
N2 - In this work, we develop and test a new modeling framework for the shelter site location problem under demand uncertainty. In particular, we propose a maxmin probabilistic programming model that includes two types of probabilistic constraints: one concerning the utilization rate of the selected shelters and the other concerning the capacity of those shelters. By invoking the central limit theorem we are able to obtain an optimization model with a single set of non-linear constraints which, nonetheless, can be approximated using a family of piecewise linear functions. The latter, in turn, can be modeled mathematically using integer variables. Eventually, an approximate model is obtained, which is a mixed-integer linear programming model that can be tackled by an off-the-shelf solver. Using the proposed reformulation we are able to solve instances of the problem using data associated with the Kartal district in Istanbul, Turkey. We also consider a large-scale instance of the problem by making use of data for the whole Anatolian side of Istanbul. The results obtained are presented and discussed in the paper. They provide clear evidence that capturing uncertainty in the shelter site location problem by means of probabilistic constraints may lead to solutions that are much different from those obtained when a deterministic counterpart is considered. Furthermore, it is possible to observe that the probabilities embedded in the probabilistic constraints have a clear influence in the results, thus supporting the statement that a probabilistic programming modeling framework, if appropriately tuned by a decision maker, can make a full difference when it comes to find good solutions for the problem.
AB - In this work, we develop and test a new modeling framework for the shelter site location problem under demand uncertainty. In particular, we propose a maxmin probabilistic programming model that includes two types of probabilistic constraints: one concerning the utilization rate of the selected shelters and the other concerning the capacity of those shelters. By invoking the central limit theorem we are able to obtain an optimization model with a single set of non-linear constraints which, nonetheless, can be approximated using a family of piecewise linear functions. The latter, in turn, can be modeled mathematically using integer variables. Eventually, an approximate model is obtained, which is a mixed-integer linear programming model that can be tackled by an off-the-shelf solver. Using the proposed reformulation we are able to solve instances of the problem using data associated with the Kartal district in Istanbul, Turkey. We also consider a large-scale instance of the problem by making use of data for the whole Anatolian side of Istanbul. The results obtained are presented and discussed in the paper. They provide clear evidence that capturing uncertainty in the shelter site location problem by means of probabilistic constraints may lead to solutions that are much different from those obtained when a deterministic counterpart is considered. Furthermore, it is possible to observe that the probabilities embedded in the probabilistic constraints have a clear influence in the results, thus supporting the statement that a probabilistic programming modeling framework, if appropriately tuned by a decision maker, can make a full difference when it comes to find good solutions for the problem.
KW - Approximations
KW - Humanitarian logistics
KW - Location
KW - Probabilistic programming
KW - Shelter site location
UR - http://www.scopus.com/inward/record.url?scp=85044519978&partnerID=8YFLogxK
U2 - 10.1016/j.ejor.2018.03.006
DO - 10.1016/j.ejor.2018.03.006
M3 - Article
AN - SCOPUS:85044519978
SN - 0377-2217
VL - 270
SP - 132
EP - 145
JO - European Journal of Operational Research
JF - European Journal of Operational Research
IS - 1
ER -