Network repair crew scheduling and routing for emergency relief distribution problem

Pablo A. Maya Duque*, Irina S. Dolinskaya, Kenneth Sörensen

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

55 Scopus citations

Abstract

Every year, hundreds of thousands of people are affected by natural disasters. The number of casualties is usually increased by lack of clean water, food, shelter, and adequate medical care during the aftermath. One of the main problems influencing relief distribution is the state of the post-disaster road network. In this paper, we consider the problem of scheduling the emergency repair of a rural road network that has been damaged by the occurrence of a natural disaster. This problem, which we call the Network Repair Crew Scheduling and Routing Problem addresses the scheduling and routing of a repair crew optimizing accessibility to the towns and villages that demand humanitarian relief by repairing roads. We develop both an exact dynamic programming (DP) algorithm and an iterated greedy-randomized constructive procedure to solve the problem and compare the performance of both approaches on small- to medium-scale instances. Our numerical analysis of the solution structure validates the optimization model and provides managerial insights into the problem and its solutions.

Original languageEnglish (US)
Pages (from-to)272-285
Number of pages14
JournalEuropean Journal of Operational Research
Volume248
Issue number1
DOIs
StatePublished - Jan 1 2016

Keywords

  • Dynamic programming
  • Iterated greedy-randomized constructive procedure
  • Network repair
  • Repair crew routing
  • Repair crew scheduling

ASJC Scopus subject areas

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Fingerprint Dive into the research topics of 'Network repair crew scheduling and routing for emergency relief distribution problem'. Together they form a unique fingerprint.

Cite this