ADAPTIVE DISASTER RELIEF ROUTING USING DEEP REINFORCEMENT LEARNING UNDER DYNAMIC ROAD DISRUPTIONS
- Department of Computer Science and Engineering, BBD Institute of Technology and Management, Lucknow, India.
6 Downloads
169 Views
Abstract
Natural disasters such as floods frequently disrupt transportation networks, significantly hindering emergency relief logistics and delaying the delivery of critical supplies. Traditional routing optimization methods, including shortest-path algorithms and metaheuristic approaches, typically assume static network conditions and struggle to adapt to rapidly evolving road disruptions. This paper proposes a Deep Reinforcement Learning (DRL) framework for adaptive disaster relief routing in dynamically changing environments. The problem is formulated as a Dynamic Vehicle Routing Problem (DVRP) modeled using a Markov Decision Process (MDP). A grid-based city simulation with nine demand nodes and stochastic road blockages is developed to emulate flood-induced transportation disruptions.Two DRL algorithms, Deep Q-Network (DQN) and Proximal Policy Optimization (PPO), are evaluated and compared against a Genetic Algorithm (GA) baseline. Experimental results demonstrate that the PPO-based routing policy achieves improved adaptability and reduced delivery delays under high disruption scenarios, outperforming traditional optimization methods. Furthermore, the DRL agents exhibit faster recovery and policy adjustment following sudden road blockages. The findings highlight the potential of reinforcement learning–based decision systems for real-time disaster logistics planning and adaptive emergency response.
Keywords
How to Cite This Article
Archana Dwivedi, Shivam Maurya et, al (2026); ADAPTIVE DISASTER RELIEF ROUTING USING DEEP REINFORCEMENT LEARNING UNDER DYNAMIC ROAD DISRUPTIONS, International Journal of Advanced Research (IJAR), 14 (03), 828-834, ISSN 2320-5407. DOI: https://doi.org/10.21474/IJAR01/23004
Corresponding Author
Article Analytics
Similar Articles
12
93
34
131
50
164
10
63
9
121
This work is licensed under a Creative Commons Attribution 4.0 International License.





