Journal of the Operational Research Society

, Volume 61, Issue 4, pp 543–550

Scheduling ambulance crews for maximum coverage

Case-Oriented Paper

DOI: 10.1057/jors.2008.163

Cite this article as:
Erdoğan, G., Erkut, E., Ingolfsson, A. et al. J Oper Res Soc (2010) 61: 543. doi:10.1057/jors.2008.163

Abstract

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 that use the output of the tabu search algorithm are constructed for the main problem. Computational experiments with real data are conducted. A comparison of the results of the models is presented.

Keywords

ambulance location shift scheduling tabu search integer programming 

Copyright information

© Palgrave Macmillan 2009

Authors and Affiliations

  1. 1.Ozyegin UniversityİstanbulTurkey
  2. 2.University of AlbertaAlbertaCanada
  3. 3.HEC MontréalMontréalCanada