Scheduling ambulance crews for maximum coverage

  title={Scheduling ambulance crews for maximum coverage},
  author={G{\"u}nes Erdogan and Erhan Erkut and Armann Ingolfsson and Gilbert Laporte},
This paper addresses the problem of scheduling ambulance crews in order to maximize the coverage throughout a planning horizon. The problem includes the subproblem of locating ambulances to maximize expected coverage with probabilistic response times, for which a tabu search algorithm is developed. The proposed tabu search algorithm is empirically shown to outperform previous approaches for this subproblem. Two integer programming models which use the output of the tabu search algorithm are… CONTINUE READING