Highlights We present the location and location-routing problem. The beneficiaries are refugees and their camp locations are decision variables. The public service providers are routed from their institutions to the located camps. We develop an exact branch-price-and-cut algorithm.
Abstract 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.
The location and location-routing problem for the refugee camp network design
Transportation Research Part B: Methodological ; 143 ; 201-220
2020-11-19
20 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
The location-or-routing problem
Elsevier | 2021
|A warehouse location-routing problem
Elsevier | 1985
|The time-dependent location-routing problem
Elsevier | 2019
|The Multicommodity-Ring Location Routing Problem
Online Contents | 2016
|The Multicommodity-Ring Location Routing Problem
British Library Online Contents | 2016
|