Optimizing Fleet Staging of Air Ambulances in the Province of Ontario

  • Geoffrey T. PondEmail author
  • Greg McQuat
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11324)


The staging (or locating) of air ambulances throughout a jurisdiction of responsibility is widely accepted to be influential in achieving positive patient outcomes. Traditionally, the assignment of bases is made as a function of either population density or by maximizing coverage. This work leverages historical data detailing missions executed by an air ambulance service to identify locations for bases that minimize the total distances flown by the fleet throughout the study period. Given the known computational complexity of the problem (NP-hard), and volume of data being examined, a genetic algorithm was chosen due to its demonstrated effectiveness at solving combinatorial problems. Over the course of the evolutionary process, the objection function value of the population’s best-performing chromosome decreased by 24%.


Logistics Genetic algorithm Optimization Location planning Emergency services 


  1. 1.
    Archetti, C., Feillet, D., Speranza, M.G.: Complexity of routing problems with release dates. Eur. J. Oper. Res. 247(3), 797–803 (2015)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Blackwell, T.H., Kline, J.A., Willis, J.J., Hicks, G.M.: Lack of association between prehospital response times and patient outcomes. Prehospital Emerg. Care 13(4), 444–450 (2009)CrossRefGoogle Scholar
  3. 3.
    Cannon, E., Shaw, J., Fothergill, R., Lindridge, J.: Ambulance response times and mortality in elderly fallers. Emerg. Med. J. 33(9) (2016)CrossRefGoogle Scholar
  4. 4.
    Dong, Z., Chuhang, Y., Lau, H.Y.K.H.: An integrated flight scheduling and fleet assignment method based on a discrete choice model. Comput. Ind. Eng. 98, 195–210 (2016)CrossRefGoogle Scholar
  5. 5.
    Fernández-Cuesta, E., Norddal, I.K., Andersson, H., Fagerholt, K.: Base location and helicopter fleet composition in the oil industry. INFOR: Inf. Syst. Oper. Res. 55(2), 71–92 (2017)MathSciNetGoogle Scholar
  6. 6.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H Freeman and Company, New York (1977)zbMATHGoogle Scholar
  7. 7.
    Gopalan, R.: Computational complexity of convoy movement planning problems. Math. Methods Oper. Res. 82(1), 31–60 (2015)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Huwang, M., Chiang, C., Liu, Y.: Solving a fuzzy set-covering problem. Math. Comput. Model. 40(7–8), 861–865 (2004)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Jeong, H., Moon, H., Lee, J., Lee, D., Choi, J., Jung, Y.: The effect of ambulance response time in the outcomes of patients with out-of-hospital cardiac arrest. Resuscitation 118, e35 (2017)CrossRefGoogle Scholar
  10. 10.
    Koç, Ç., Bektaş, T., Jabali, O., Laporte, G.: The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm. Eur. J. Oper. Res. 248(1), 33–51 (2016)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Maleki, M., Majlesinasab, N., Sepehri, M.M.: Two new models for redeployment of ambulances. Comput. Ind. Eng. 78, 271–284 (2014)CrossRefGoogle Scholar
  12. 12.
    McCormack, R., Coates, G.: A simulation model to enable the optimization of ambulance fleet allocation and base station location for increased patient survival. Eur. J. Oper. Res. 247(1), 294–309 (2015)CrossRefGoogle Scholar
  13. 13.
    Perez, M.: Response time to the emergency department (ED) and its effect on patient flow and hospital outcomes. Chest 148(4) (2015)CrossRefGoogle Scholar
  14. 14.
    Schmid, V.: Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming. Eur. J. Oper. Res. 219(3), 611–621 (2012)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Zhen, L., Wang, K., Hu, H., Chang, D.: A simulation optimization framework for ambulance deployment and relocation problems. Comput. Ind. Eng. 72, 12–23 (2014)CrossRefGoogle Scholar
  16. 16.
    Zimmermann, K.: Fuzzy set covering problem. Int. J. Gen. Syst. 20(1), 127–131 (1991)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Royal Military College of CanadaKingstonCanada

Personalised recommendations