An online optimization approach for post-disaster relief distribution with online blocked edges

Basit Öğe Kaydı
dc.authorid0000-0003-2884-0047
dc.contributor.authorAkbari, Vahid
dc.contributor.authorShiri, Davood
dc.date.accessioned2021-09-24T06:21:55Z
dc.date.available2021-09-24T06:21:55Z
dc.date.issued2022
dc.departmentİstanbul Medipol Üniversitesi, Mühendislik ve Doğa Bilimleri Fakültesi, Endüstri Mühendisliği Bölümü
dc.description.abstractDisasters can disrupt road networks by blocking some of the roads and consequently impeding accessibility to critical locations. In the immediate post-disaster response phase, while the blockage information is yet to be collected, relief distribution crews (RDCs) should dispatch from warehouses to supply critical locations with first aid items. The RDCs are not capable of unblocking damaged roads and should find a way to bypass them once such edges are observed in their routes. With the objective of minimizing total latency of the critical nodes, we study the problem that addresses the relief distribution operations with k non-recoverable online blocked edges. The online blocked edges are not known to the RDCs initially and the blockage of a blocked edge is revealed when one of the RDCs arrives at one of its end-nodes. Once one of the RDCs knows about a blocked edge, this information is communicated among the rest of the RDCs and they will all be informed about that blocked edge. We first investigate the worst-case performance of online algorithms against offline optimal solutions using competitive ratio. We then prove a lower bound on the competitive ratio of deterministic online algorithms. We also provide an upper bound on the competitive ratio of the optimal deterministic online algorithms by introducing a deterministic algorithm which achieves a bounded competitive ratio. We then develop three heuristic algorithms to solve this problem. One of our algorithms is based on solving an Integer Programming model to find the assignment of the nodes to the RDCs and then finding the routes dynamically. The other algorithms are not based on solving optimization models and hence are more efficient in terms of their computational time. We compare our proposed heuristic algorithms with the best known algorithms from the literature that are developed for a single RDC variation of the problem. Finally, we provide a through computational analysis of our algorithms on instances adopted from real-world road networks.
dc.identifier.citationAkbari, V. ve Shiri, D. (2022). An online optimization approach for post-disaster relief distribution with online blocked edges. Computers and Operations Research, 137. https://dx.doi.org/10.1016/j.cor.2021.105533
dc.identifier.doi10.1016/j.cor.2021.105533
dc.identifier.issn0305-0548
dc.identifier.scopusqualityQ1
dc.identifier.urihttps://dx.doi.org/10.1016/j.cor.2021.105533
dc.identifier.urihttps://hdl.handle.net/20.500.12511/8288
dc.identifier.volume137
dc.identifier.wosqualityQ2
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherElsevier Ltd
dc.relation.ispartofComputers and Operations Researchen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/embargoedAccess
dc.subjectCompetitive Ratio
dc.subjectDisaster Response
dc.subjectEmergency Logistics
dc.subjectMinimum Latency Problem
dc.subjectOnline Optimization
dc.subjectOR in Disaster Relief
dc.subjectRelief Distribution
dc.subjectTraveling Repairman Problem
dc.titleAn online optimization approach for post-disaster relief distribution with online blocked edges
dc.typeArticle

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
Ä°sim:
Shiri-Davood-2022.pdf
Boyut:
2.25 MB
Biçim:
Adobe Portable Document Format
Açıklama:
Tam Metin / Full Text
Ä°ndir
Lisans paketi
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
Ä°sim:
license.txt
Boyut:
1.44 KB
Biçim:
Item-specific license agreed upon to submission
Açıklama:
Ä°ndir

Koleksiyon

Makale Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu
WoS İndeksli Yayınlar Koleksiyonu