Inventory routing for the last mile delivery of humanitarian relief supplies

Name: Inventory routing for the last mile delivery of humanitarian relief supplies
Author: Ekici, Ali, Özener, Okan Örsan

İsim	Inventory routing for the last mile delivery of humanitarian relief supplies
Yazar	Ekici, Ali, Özener, Okan Örsan
Basım Tarihi:	2020-09
Basım Yeri	- Springer Nature
Konu	Relief supplies distribution, Last mile delivery, Inventory routing, Clustering
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	0171-6468
Kayıt Numarası	bcecd9c3-b131-41c2-997a-728306806e9e
Lokasyon	Industrial Engineering
Tarih	2020-09
Örnek Metin	Fast and equitable distribution of the humanitarian relief supplies is key to the success of relief operations. Delayed and inequitable deliveries can result in suffering of affected people and loss of lives. In this study, we analyze the routing operations for the delivery of relief supplies from a distribution center to the dispensing sites. We assume that the relief supplies to be distributed arrive at the distribution center in batches and are consumed at the dispensing sites with a certain daily rate. When forming delivery schedules, we use the ratio of the inventory to the daily consumption rate at the dispensing sites as our decision criterion. This ratio is called theslackand can be considered as the safety stock (when positive) in case of a delay in the deliveries. Negative value for theslackmeans the dispensing site has stock-outs. Our objective is to maximize the minimum value of thisslackamong all dispensing sites. This is equivalent to maximizing the minimum safety stock or minimizing the maximum duration of the stock-outs. Due to multi-period structure of the problem, it is modeled as a variant of theInventory Routing Problem. To address the problem, we propose a general framework which includes clustering, routing and improvement steps. The proposed framework considers the interdependence between all three types of decisions (clustering, routing and resource allocation) and makes the decisions in an integrated manner. We test the proposed framework on randomly generated instances and compare its performance against the benchmark algorithms in the literature. The proposed framework not only outperforms the benchmark algorithms by at least 1% less optimality gap but also provides high-quality solutions with around 2-3% optimality gaps.
DOI	10.1007/s00291-020-00572-2
Cilt	42

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

Inventory routing for the last mile delivery of humanitarian relief supplies

Yazar Ekici, Ali, Özener, Okan Örsan

Basım Tarihi 2020-09

Basım Yeri - Springer Nature

Konu Relief supplies distribution, Last mile delivery, Inventory routing, Clustering

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 0171-6468

Kayıt Numarası bcecd9c3-b131-41c2-997a-728306806e9e

Lokasyon Industrial Engineering

Tarih 2020-09

Örnek Metin Fast and equitable distribution of the humanitarian relief supplies is key to the success of relief operations. Delayed and inequitable deliveries can result in suffering of affected people and loss of lives. In this study, we analyze the routing operations for the delivery of relief supplies from a distribution center to the dispensing sites. We assume that the relief supplies to be distributed arrive at the distribution center in batches and are consumed at the dispensing sites with a certain daily rate. When forming delivery schedules, we use the ratio of the inventory to the daily consumption rate at the dispensing sites as our decision criterion. This ratio is called theslackand can be considered as the safety stock (when positive) in case of a delay in the deliveries. Negative value for theslackmeans the dispensing site has stock-outs. Our objective is to maximize the minimum value of thisslackamong all dispensing sites. This is equivalent to maximizing the minimum safety stock or minimizing the maximum duration of the stock-outs. Due to multi-period structure of the problem, it is modeled as a variant of theInventory Routing Problem. To address the problem, we propose a general framework which includes clustering, routing and improvement steps. The proposed framework considers the interdependence between all three types of decisions (clustering, routing and resource allocation) and makes the decisions in an integrated manner. We test the proposed framework on randomly generated instances and compare its performance against the benchmark algorithms in the literature. The proposed framework not only outperforms the benchmark algorithms by at least 1% less optimality gap but also provides high-quality solutions with around 2-3% optimality gaps.

DOI 10.1007/s00291-020-00572-2

Cilt 42