The location and location-routing problem for the refugee camp network design

被引：18

作者：

Arslan, Okan ^{[1
,2
]}

Kumcu, Gul Culhan ^{[3
]}

Kara, Bahar Yetis ^{[4
]}

Laporte, Gilbert ^{[1
,2
,5
]}

机构：

[1] HEC Montreal, Montreal, PQ, Canada

[2] CIRRELT, Montreal, PQ, Canada

[3] Rutgers State Univ, Rutgers Business Sch, New Brunswick, NJ USA

[4] Bilkent Univ, Dept Ind Engn, Ankara, Turkey

[5] Univ Bath, Sch Management, Bath, Avon, England

来源：

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL | 2021年 / 143卷

基金：

加拿大自然科学与工程研究理事会;

关键词：

Refugee camp location; Location-routing problem; Vehicle routing problem; Transportation; Humanitarian logistics; Branch-price-and-cut;

D O I：

10.1016/j.trb.2020.11.010

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

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 branchprice-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. (C) 2020 Elsevier Ltd. All rights reserved.

引用

页码：201 / 220

页数：20

共 53 条

[41] Post-disaster relief-service centralized logistics distribution with survivor resilience maximization [J].