TY - JOUR
T1 - The location and location-routing problem for the refugee camp network design
AU - Arslan, Okan
AU - Kumcu, Gül Çulhan
AU - Kara, Bahar Yetiş
AU - Laporte, Gilbert
N1 - Funding Information:
The authors gratefully acknowledge funding provided by the Canadian Natural Sciences and Engineering Research Council under grant 2015–06189 and by the Scientific and Technological Research Council of Turkey (TUBITAK) under the grant number 216M380. Thanks are due to the Associate Editor and to the referees for their valuable comments.
Publisher Copyright:
© 2020 Elsevier Ltd
Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2021/1/1
Y1 - 2021/1/1
N2 - The refugee crisis is one of the major challenges of modern society. The influxes of refugees are usually sudden and the refugees are in sheer need of services such as health care, education and safety. Planning public services under an imminent humanitarian crisis requires simultaneous strategic and operational decisions. Inspired by a real-world problem that Red Crescent is facing in Southeast Turkey, we study the problem of locating refugee camps and planning transportation of public service providers from their institutions to the located camps. Our modeling approach brings a new facet to the location and routing problem by considering the location of beneficiaries as variables. We develop a branch-price-and-cut algorithm for the problem. To solve the pricing problem, we introduce a cycle-eliminating algorithm using nested recursion to generate elementary hop constrained shortest paths. The best version of our algorithm efficiently solves 244-node real-world instances optimally.
AB - The refugee crisis is one of the major challenges of modern society. The influxes of refugees are usually sudden and the refugees are in sheer need of services such as health care, education and safety. Planning public services under an imminent humanitarian crisis requires simultaneous strategic and operational decisions. Inspired by a real-world problem that Red Crescent is facing in Southeast Turkey, we study the problem of locating refugee camps and planning transportation of public service providers from their institutions to the located camps. Our modeling approach brings a new facet to the location and routing problem by considering the location of beneficiaries as variables. We develop a branch-price-and-cut algorithm for the problem. To solve the pricing problem, we introduce a cycle-eliminating algorithm using nested recursion to generate elementary hop constrained shortest paths. The best version of our algorithm efficiently solves 244-node real-world instances optimally.
KW - Branch-price-and-cut
KW - Humanitarian logistics
KW - Location-routing problem
KW - Refugee camp location
KW - Transportation
KW - Vehicle routing problem
KW - Sustainability
KW - Refugees
UR - http://www.scopus.com/inward/record.url?scp=85097166160&partnerID=8YFLogxK
U2 - 10.1016/j.trb.2020.11.010
DO - 10.1016/j.trb.2020.11.010
M3 - Article
AN - SCOPUS:85097166160
SN - 0191-2615
VL - 143
SP - 201
EP - 220
JO - Transportation Research Part B: Methodological
JF - Transportation Research Part B: Methodological
ER -
