Extending Hybrid GRG-NS With LSTM-Based Demand Forecasting for Dynamic Multi-Depot Routing in Disaster Logistics

Dedy Hartama, Poningsih Poningsih, Lili Tanti

Abstract


Disaster logistics management requires accurate demand forecasting and efficient routing optimization to ensure timely distribution of emergency supplies under dynamic and uncertain conditions. Conventional routing approaches often experience limitations in handling fluctuating disaster demand, resulting in inefficient distribution performance and increased operational costs. This study proposes an integrated LSTM–Hybrid Generalized Reduced Gradient and Neighborhood Search (LSTM–Hybrid GRG–NS) framework for disaster-demand forecasting and routing optimization. The proposed approach combines Long Short-Term Memory (LSTM) for sequential demand prediction with a hybrid GRG–NS optimization mechanism to improve routing efficiency and solution convergence. Experimental evaluation was conducted using disaster-demand scenarios and routing datasets to assess forecasting and optimization performance. The forecasting results demonstrated strong predictive capability with low MAE, RMSE, and MAPE values, indicating that the LSTM model effectively captured temporal demand patterns. Furthermore, the routing optimization results showed that the proposed framework successfully generated stable and near-optimal routing solutions while maintaining full demand fulfillment and efficient vehicle utilization. The convergence analysis also confirmed that the optimization process converged consistently within a limited number of iterations. Overall, the proposed LSTM–Hybrid GRG–NS framework provides an effective and reliable decision-support approach for proactive humanitarian logistics and disaster-routing management.


Keywords


Disaster Logistics; LSTM Forecasting; Routing Optimization; Hybrid GRG–NS; Humanitarian Supply Chain

Full Text:

PDF

References


B. Balcik and B. M. Beamon, “Facility location in humanitarian relief,” International Journal of Logistics Research and Applications, vol. 11, no. 2, pp. 101–121, 2008, doi: 10.1080/13675560701561789.

A. M. Caunhye, X. Nie, and S. Pokharel, “Optimization models in emergency logistics: A literature review,” Socio-Economic Planning Sciences, vol. 46, no. 1, pp. 4–13, 2012, doi: 10.1016/j.seps.2011.04.004.

A. Bozorgi-Amiri, M. S. Jabalameli, and S. M. J. Mirzapour Al-e-Hashem, “A multi-objective robust stochastic programming model for disaster relief logistics under uncertainty,” OR Spectrum, vol. 35, no. 4, pp. 905–933, 2013, doi: 10.1007/s00291-011-0268-x.

S. Wang, W. Sun, and M. Huang, “An adaptive large neighborhood search for the multi-depot dynamic vehicle routing problem with time windows,” Computers & Industrial Engineering, vol. 191, p. 110122, 2024, doi: 10.1016/j.cie.2024.110122.

Y. Wang, Z. Wei, S. Luo, J. Zhou, and L. Zhen, “Collaboration and resource sharing in the multidepot time-dependent vehicle routing problem with time windows,” Transportation Research Part E: Logistics and Transportation Review, vol. 192, p. 103798, 2024, doi: 10.1016/j.tre.2024.103798.

M. Tavana, A.-R. Abtahi, D. Di Caprio, R. Hashemi, and R. Yousefi-Zenouz, “An integrated location-inventory-routing humanitarian supply chain network with pre- and post-disaster management considerations,” Socio-Economic Planning Sciences, vol. 64, pp. 21–37, 2018, doi: 10.1016/j.seps.2017.12.004.

H. O. Mete and Z. B. Zabinsky, “Stochastic optimization of medical supply location and distribution in disaster management,” International Journal of Production Economics, vol. 126, no. 1, pp. 76–84, 2010, doi: 10.1016/j.ijpe.2009.10.004.

N. Noyan, “Risk-averse two-stage stochastic programming with an application to disaster management,” Computers & Operations Research, vol. 39, no. 3, pp. 541–559, 2012, doi: 10.1016/j.cor.2011.03.017.

S. Ropke and D. Pisinger, “An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows,” Transportation Science, vol. 40, no. 4, pp. 455–472, 2006, doi: 10.1287/trsc.1050.0135.

D. Pisinger and S. Ropke, “A general heuristic for vehicle routing problems,” Computers & Operations Research, vol. 34, no. 8, pp. 2403–2435, 2007, doi: 10.1016/j.cor.2005.09.012.

J.-F. Cordeau, M. Gendreau, and G. Laporte, “A tabu search heuristic for periodic and multi-depot vehicle routing problems,” Networks, vol. 30, no. 2, pp. 105–119, 1997, doi: 10.1002/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G.

N. Mladenović and P. Hansen, “Variable neighborhood search,” Computers & Operations Research, vol. 24, no. 11, pp. 1097–1100, 1997, doi: 10.1016/S0305-0548(97)00031-2.

P. Stodola and L. Kutěj, “Multi-Depot Vehicle Routing Problem with Drones: Mathematical formulation, solution algorithm and experiments,” Expert Systems with Applications, vol. 241, p. 122483, 2024, doi: 10.1016/j.eswa.2023.122483.

M. A. Masmoudi, M. Hosny, E. Demir, E. Pesch, and K. N. Genikomsakis, “The vehicle routing problem with drones equipped with multi-package payload compartments,” Transportation Research Part E: Logistics and Transportation Review, vol. 164, p. 102757, 2022, doi: 10.1016/j.tre.2022.102757.

Y. Yin, Y. Yang, Y. Yu, D. Wang, and T. C. E. Cheng, “Robust vehicle routing with drones under uncertain demands and truck travel times in humanitarian logistics,” Transportation Research Part B: Methodological, vol. 174, p. 102781, 2023, doi: 10.1016/j.trb.2023.102781.

C.-L. Lee, K. Lee, and S. Park, “Robust vehicle routing problem with deadlines and travel time/demand uncertainty,” Journal of the Operational Research Society, vol. 63, no. 9, pp. 1294–1306, 2012, doi: 10.1057/jors.2011.121.

W. Pan and S. Q. Liu, “Deep reinforcement learning for the dynamic and uncertain vehicle routing problem,” Applied Intelligence, vol. 53, no. 1, pp. 405–422, 2023, doi: 10.1007/s10489-022-03456-w.

S. Kadyrov, A. Azamov, Y. Abdumajitov, and C. Turan, “Deep reinforcement learning for dynamic vehicle routing with demand and traffic uncertainty,” Operations Research Perspectives, vol. 15, p. 100351, 2025, doi: 10.1016/j.orp.2025.100351.

A. Hottung and K. Tierney, “Neural large neighborhood search for routing problems,” Artificial Intelligence, vol. 313, p. 103786, 2022, doi: 10.1016/j.artint.2022.103786.

T. Guo, Y. Mei, M. Zhang, H. Zhao, K. Cai, and W. Du, “Learning-Aided Neighborhood Search for Vehicle Routing Problems,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 47, no. 7, pp. 5930–5944, 2025, doi: 10.1109/TPAMI.2025.3554669.

B. Sonnleitner, N. Kourentzes, C. Ehrig, and A. Pflaum, “Forecasting for optimization in road freight transport: A review,” Transportation Research Part E: Logistics and Transportation Review, vol. 204, p. 104378, 2025, doi: 10.1016/j.tre.2025.104378.

L. S. Lasdon, A. D. Waren, A. Jain, and M. Ratner, “Design and testing of a generalized reduced gradient code for nonlinear programming,” ACM Transactions on Mathematical Software, vol. 4, no. 1, pp. 34–50, 1978, doi: 10.1145/355769.355773.

J.-B. Sheu, “Dynamic relief-demand management for emergency logistics operations under large-scale disasters,” Transportation Research Part E: Logistics and Transportation Review, vol. 46, no. 1, pp. 1–17, 2010, doi: 10.1016/j.tre.2009.07.005.

B. Lim and S. Zohren, “Time-series forecasting with deep learning: a survey,” Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 379, no. 2194, p. 20200209, 2021, doi: 10.1098/rsta.2020.0209.

Y. Zhang, R. Bai, R. Qu, C. Tu, and J. Jin, “A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties,” European Journal of Operational Research, vol. 300, no. 2, pp. 418–427, 2022, doi: 10.1016/j.ejor.2021.10.032.

R. Carbonneau, K. Laframboise, and R. Vahidov, “Application of machine learning techniques for supply chain demand forecasting,” European Journal of Operational Research, vol. 184, no. 3, pp. 1140–1154, 2008, doi: 10.1016/j.ejor.2006.12.004.

S. Hochreiter and J. Schmidhuber, “Long Short-Term Memory,” Neural Computation, vol. 9, no. 8, pp. 1735–1780, 1997, doi: 10.1162/neco.1997.9.8.1735.

Y. Li and Z. Wei, “Regional Logistics Demand Prediction: A Long Short-Term Memory Network Method,” Sustainability, vol. 14, no. 20, p. 13478, 2022, doi: 10.3390/su142013478.

H. Abbasimehr, M. Shabani, and M. Yousefi, “An optimized model using LSTM network for demand forecasting,” Computers & Industrial Engineering, vol. 143, p. 106435, 2020, doi: 10.1016/j.cie.2020.106435.

M. Pacella, G. Papadia, and A. Grieco, “Evaluation of deep learning with long short-term memory networks for time series forecasting in supply chain management,” Procedia CIRP, vol. 99, pp. 604–609, 2021, doi: 10.1016/j.procir.2021.03.080.

X. Ma, Z. Tao, Y. Wang, H. Yu, and Y. Wang, “Long short-term memory neural network for traffic speed prediction using remote microwave sensor data,” Transportation Research Part C: Emerging Technologies, vol. 54, pp. 187–197, 2015, doi: 10.1016/j.trc.2015.03.014.

D. Hartama and L. Tanti, “A Hybrid GRG-Neighborhood Search Model for Dynamic Multi-Depot Vehicle Routing in Disaster Logistics,” vol. 6, no. 4, pp. 2876–2890, 2025.

M. Ahmadi, A. Seifi, and B. Tootooni, “A humanitarian logistics model for disaster relief operation considering network failure and standard relief time: A case study on San Francisco district,” Transportation Research Part E: Logistics and Transportation Review, vol. 75, pp. 145–163, 2015, doi: 10.1016/j.tre.2015.01.008.

S. Erdougan and E. Miller-Hooks, “A Green Vehicle Routing Problem,” Transportation Research Part E: Logistics and Transportation Review, vol. 48, no. 1, pp. 100–114, 2012, doi: 10.1016/j.tre.2011.08.001.




DOI: https://doi.org/10.47738/jads.v7i3.1444

Refbacks

  • There are currently no refbacks.



Barcode

Journal of Applied Data Sciences

ISSN : 2723-6471 (Online)
Publisher : Bright Publisher
Website : http://bright-journal.org/JADS
Email : taqwa@amikompurwokerto.ac.id (principal contact)
    support@bright-journal.org (technical issues)

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0