The Stochastic Dynamic Postdisaster Inventory Allocation Problem with Trucks and UAVs

Research output: Contribution to journalArticleAcademicpeer-review

62 Downloads (Pure)

Abstract

Humanitarian logistics operations face increasing difficulties due to rising demands for aid in disaster areas. This paper investigates the dynamic allocation of scarce relief supplies across multiple affected districts over time. It introduces a novel stochastic dynamic postdisaster inventory allocation problem (SDPDIAP) with trucks and unmanned aerial vehicles (UAVs) delivering relief goods under uncertain supply and demand. The relevance of this humanitarian logistics problem lies in the importance of considering the intertemporal social impact of deliveries. We achieve this by considering social costs (transportation and deprivation costs) when allocating scarce supplies. Furthermore, we consider the inherent uncertainties of disaster areas and the potential use of cargo UAVs to enhance operational efficiency. This study proposes two anticipatory solution methods based on approximate dynamic programming, specifically decomposed linear value function approximation (DL-VFA) and neural network value function approximation (NN-VFA) to effectively manage uncertainties in the dynamic allocation process. We compare DL-VFA and NN-VFA with various state-of-the-art methods (e.g., exact reoptimization and proximal policy optimization) and results show a 6%–8% improvement compared with the best benchmarks. NN-VFA provides the best performance and captures nonlinearities in the problem, whereas DL-VFA shows excellent scalability against a minor performance loss. From a practical standpoint, the experiments reveal that consideration of social costs results in improved allocation of scarce supplies both across affected districts and over time. Finally, results show that deploying UAVs can play a crucial role in the allocation of relief goods, especially in the first stages after a disaster. The use of UAVs reduces transportation and deprivation costs together by 16%–20% and reduces maximum deprivation times by 19%–40% while maintaining similar levels of demand coverage, showcasing efficient and effective operations.

Original languageEnglish
Pages (from-to)360-390
Number of pages31
JournalTransportation science
Volume59
Issue number2
Early online date27 Feb 2025
DOIs
Publication statusPublished - Mar 2025

Keywords

  • 2025 OA procedure
  • Dynamic resource allocation
  • Humanitarian logistics
  • Reinforcement learning
  • UAVs
  • Deprivation costs

Fingerprint

Dive into the research topics of 'The Stochastic Dynamic Postdisaster Inventory Allocation Problem with Trucks and UAVs'. Together they form a unique fingerprint.

Cite this