Skip to main content
Log in

Integrated optimal scheduling and routing of repair crew and relief vehicles after disaster: a novel hybrid solution approach

  • Original Research
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

After a natural disaster or a large-scale incident, some of the utility lines and essential roads around the damaged centers may be blocked by debris from the disaster. This incident can immediately restrict crucial supply distribution and affect rescue plans. Therefore, the recovery of damaged roads is an essential step to help increase the effectiveness of the relief operations and to reduce victims’ suffering. In this study, we develop a mixed-integer programming model for optimal scheduling and routing of repair crew and relief vehicles after the disaster. The objective function is to minimize the total relief time of the disaster-affected nodes and the recovery time of damaged nodes. Demand nodes are manually weighed according to a presumed degree of damage. Given the NP-hardness nature of the problem, a hybrid approach is proposed based on the Benders decomposition method and a heuristic algorithm. The heuristic algorithm is employed as an initiation algorithm to generate an initial solution for the Benders decomposition algorithm. The routing of the repair crew and relief vehicles is drawn using the Benders decomposition algorithm. To demonstrate the performance of the hybrid algorithm, an ant colony optimization algorithm is also developed. The computational results demonstrate that the proposed approach is capable of computing a near-optimal solution in less CPU time. Furthermore, the performance of this hybrid approach is distinctively superior when it comes to routing of medium to large-scale problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  • Akbari, V., & Salman, F. S. (2017). Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity. European Journal of Operational Research, 257(2), 625–640.

    Article  Google Scholar 

  • Aksu, D. T., & Ozdamar, L. (2014). A mathematical model for post-disaster road restoration: Enabling accessibility and evacuation. Transportation Research Part e: Logistics and Transportation Review, 61, 56–67.

    Article  Google Scholar 

  • Alinaghian, M., Aghaie, M., & Sabbagh, M. S. (2019). A mathematical model for location of temporary relief centers and dynamic routing of aerial rescue vehicles. Computers & Industrial Engineering, 131, 227–241.

    Article  Google Scholar 

  • Altay, N., & Green, W. G., III. (2006). OR/MS research in disaster operations management. European Journal of Operational Research, 175(1), 475–493.

    Article  Google Scholar 

  • Avci, M., & Avci, M. G. (2017). A GRASP with iterated local search for the traveling repairman problem with profits. Computers & Industrial Engineering, 113, 323–332.

    Article  Google Scholar 

  • Benders, J. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4(1), 238–252.

    Article  Google Scholar 

  • Briskorn, D., Kimms, A., & Olschok, D. (2020). Simultaneous planning for disaster road clearance and distribution of relief goods: a basic model and an exact solution method. OR Spectrum: Quantitative Approaches in Management, pp.1–29.

  • Çelik, M., Ergun, Ö., & Keskinocak, P. (2015). The post-disaster debris clearance problem under incomplete information. Operations Research, 63(1), 65–85.

    Article  Google Scholar 

  • Costa, A. M. (2005). A survey on benders decomposition applied to fixed-charge network design problems. Computers & Operations Research, 32(6), 1429–1450.

    Article  Google Scholar 

  • Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269–271.

    Article  Google Scholar 

  • Duque, P. A. M., Coene, S., Goos, P., Sörensen, K., & Spieksma, F. (2013). The accessibility arc upgrading problem. European Journal of Operational Research, 224(3), 458–465.

    Article  Google Scholar 

  • Habib, M. S., & Sarkar, B. (2017). An integrated location-allocation model for temporary disaster debris management under an uncertain environment. Sustainability, 9(5), 716.

    Article  Google Scholar 

  • Kasaei, M., & Salman, F. S. (2016). Arc routing problems to restore connectivity of a road network. Transportation Research Part e: Logistics and Transportation Review, 95, 177–206.

    Article  Google Scholar 

  • Kim, S., Park, Y., Lee, K., & Moon, I. (2017). Repair crew scheduling considering variable disaster aspects. In IFIP International Conference on Advances in Production Management Systems (pp. 57–63). Springer, Cham.

  • Li, S., Ma, Z., & Teo, K.L. (2020). A new model for road network repair after natural disasters: integrating logistics support scheduling with repair crew scheduling and routing activities. Computers & Industrial Engineering, p.106506.

  • Li, M. Y., Zhao, X. J., Fan, Z. P., Cao, P. P., & Qu, X. N. (2019). A model for assignment of rescuers considering multiple disaster areas. International Journal of Disaster Risk Reduction, 38, 101201.

    Article  Google Scholar 

  • Lorca, Á., Çelik, M., Ergun, Ö., & Keskinocak, P. (2015). A decision-support tool for post-disaster debris operations. Procedia Eng, 107, 154–167.

    Article  Google Scholar 

  • Lorca, Á., Çelik, M., Ergun, Ö., & Keskinocak, P. (2017). An optimization-based decision-support tool for post-disaster debris operations. Production and Operations Management, 26(6), 1076–1091.

    Article  Google Scholar 

  • Martins de Sá, E. M., De Camargo, R. S., & De Miranda, G. (2013). An improved Benders decomposition algorithm for the tree of hubs location problem. European Journal of Operational Research, 226(2), 185–202.

    Article  Google Scholar 

  • Miller, C. E., Tucker, A. W., & Zemlin, R. A. (1960). Integer programming formulation of traveling salesman problems. Journal of the ACM (JACM), 7(4), 326–329.

    Article  Google Scholar 

  • Moreno, A., Munari, P., & Alem, D. (2019). A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration. European Journal of Operational Research, 275(1), 16–34.

    Article  Google Scholar 

  • Moreno, A., Munari, P., & Alem, D. (2020). Decomposition-based algorithms for the crew scheduling and routing problem in road restoration. Computers & Operations Research. https://doi.org/10.1016/j.cor.2020.104935

    Article  Google Scholar 

  • Özdamar, L., Aksu, D. T., & Ergüneş, B. (2014). Coordinating debris cleanup operations in post disaster road networks. Socio-Economic Planning Sciences, 48(4), 249–262.

    Article  Google Scholar 

  • Pramudita, A., & Taniguchi, E. (2014). Model of debris collection operation after disasters and its application in urban area. International Journal of Urban Sciences, 18(2), 218–243.

    Article  Google Scholar 

  • Şahin, H. (2013). Debris removal during disaster response phase: a case for Turkey (Doctoral dissertation, Bilkent University).

  • Shin, Y., Kim, S., & Moon, I. (2019). Integrated optimal scheduling of repair crew and relief vehicle after disaster. Computers & Operations Research, 105, 237–247.

    Article  Google Scholar 

  • Taşkin, Z.C. (2010). Benders decomposition. Wiley Encyclopedia of Operations Research and Management Science.

  • Thiruvady, D., Ernst, A. T., & Singh, G. (2016). Parallel ant colony optimization for resource constrained job scheduling. Annals of Operations Research, 242, 355–372.

    Article  Google Scholar 

  • Thomas, A. S., & Kopczak, L. R. (2005). From logistics to supply chain management: The path forward in the humanitarian sector. Fritz Institute, 15(1), 1–15.

    Google Scholar 

  • Ulusan, A., & Ergun, Ö. (2021). Approximate dynamic programming for network recovery problems with stochastic demand. Transportation Research Part e: Logistics and Transportation Review, 151, 102358.

    Article  Google Scholar 

  • Wang, S., Liu, F., Lian, L., Hong, Y., & Chen, H. (2018). Integrated post-disaster medical assistance team scheduling and relief supply distribution. The International Journal of Logistics Management.

  • Yan, S., & Shih, Y. L. (2009). Optimal scheduling of emergency roadway repair and subsequent relief distribution. Computers & Operations Research, 36(6), 2049–2065.

    Article  Google Scholar 

  • Yan, S., & Shih, Y. L. (2012). An ant colony system-based hybrid algorithm for an emergency roadway repair time-space network flow problem. Transportmetrica, 8(5), 361–386.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Donya Rahmani.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lakzaei, S., Rahmani, D., Tosarkani, B.M. et al. Integrated optimal scheduling and routing of repair crew and relief vehicles after disaster: a novel hybrid solution approach. Ann Oper Res 328, 1495–1522 (2023). https://doi.org/10.1007/s10479-023-05397-0

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-023-05397-0

Keywords

Navigation