Abstract
We describe an ambulance location optimization model that minimizes the number of ambulances needed to provide a specified service level. The model measures service level as the fraction of calls reached within a given time standard and considers response time to be composed of a random delay (prior to travel to the scene) plus a random travel time. In addition to modeling the uncertainty in the delay and in the travel time, we incorporate uncertainty in the ambulance availability in determining the response time. Models that do not account for the uncertainty in all three of these components may overestimate the possible service level for a given number of ambulances and underestimate the number of ambulances needed to provide a specified service level. By explicitly modeling the randomness in the ambulance availability and in the delays and the travel times, we arrive at a more realistic ambulance location model. Our model is tractable enough to be solved with general-purpose optimization solvers for cities with populations around one Million. We illustrate the use of the model using actual data from Edmonton.
Similar content being viewed by others
References
Atlason J, Epelman MA, Henderson SG (2007) Optimizing call center staffing using simulation and analytic center cutting-plane methods. Manage Sci, published online before print Dec 11, 2007. DOI 10.1287/mnsc.1070.0774
Berman O, Krass D (2001) Facility location problems with stochastic demands and congestion. In: Drezner Z, Hamacher HW (eds) Location analysis: applications and theory. Springer, New York
Brandeau M, Larson RC (1986) Extending and applying the hypercube model to deploy ambulances in Boston. In: Swersey A, Ignall E (eds) Delivery of urban services. North Holland, New York
Brotcorne L, Laporte G, Semet F (2003) Ambulance location and relocation models. Eur J Oper Res 147:451–463
Budge S (2004) Emergency medical service systems: modelling uncertainty in response time. Ph.D. dissertation, Department of Finance and Management Science, University of Alberta, Edmonton
Budge S, Ingolfsson A, Erkut E (2007) Approximating vehicle dispatch probabilities for emergency service systems with location-specific service times and multiple units per location. Oper Res (in press)
Channouf N, L’Ecuyer P, Ingolfsson A, Avramidis AN (2007) The application of forecasting techniques to modeling emergency medical system calls in Calgary, Alberta. Health Care Manage Sci 10:25–45
Church R, ReVelle C (1974) The maximal covering location problem. Pap Reg Sci Assoc 32:101–120
Daskin MS (1983) A maximum expected covering location model: formulation, properties, and heuristic solution. Transp Sci 17:48–70
Daskin MS (1987) Location, dispatching, and routing model for emergency services with stochastic travel times. In: Ghosh A, Rushton G (eds) Spatial analysis and location-allocation models. Van Nostrand Reinhold, New York, pp 224–265
Eaton DJ, Daskin MS, Simmons D, Bulloch B, Jansma G (1985) Determining emergency medical service vehicle deployment in Austin, Texas. Interfaces 15:96–108
Erkut E, Fenske R, Kabanuk S, Gardiner Q, Davis J (2001) Improving the emergency service delivery in St. Albert. INFOR 39:416–433
Ernst AT, Jiang H, Krishnamoorthy M, Sier D (2004) Staff scheduling and rostering: a review of applications, methods and models. Eur J Oper Res 153:3–27
Goldberg J, Dietrich R, Chen JM, Mitwasi MG, Valenzuela T, Criss E (1990) A simulation model for evaluating a set of emergency vehicle base locations: development, validation, and usage. Socio-Econ Plann Sci 24:125–141
Goldberg J, Dietrich R, Chen JM, Mitwasi MG, Valenzuela T, Criss E (1990) Validating and applying a model for locating emergency medical vehicles in Tucson, AZ. Eur J Oper Res 49:308–324
Goldberg J, Paz L (1991) Locating emergency vehicle bases when service time depends on call location. Transp Sci 25:264–280
Green LV, Kolesar PJ, Soares J (2001) Improving the SIPP approach for staffing service systems that have cyclic demand. Oper Res 49:549–564
Gross D, Harris CM (1998) Fundamentals of queueing theory, 3rd edn. Wiley, New York
Henderson SG, Mason AJ (2000) Development of a simulation and data visualisation tool to assist in strategic operations management in emergency services. School of Engineering Technical Report 595, University of Auckland, January 2000
Henderson SG, Mason AJ (2004) Ambulance service planning: simulation and data visualisation. In: Brandeau M, Sainfort F, Pierskalla W (eds) Operations research and health care: a handbook of methods and applications. Springer, New York
Ingolfsson A, Erkut E, Budge S (2003) Simulating a single start station for Edmonton EMS. J Oper Res Soc 54:736–746
Ingolfsson A, Cabral E, Wu X (2007) Combining integer programming and the randomization method to schedule employees. Working paper. http://www.business.ualberta.ca/aingolfsson/publications.htm
Jarvis J (1981) Optimal assignments in a Markovian queueing system. Comput Oper Res 8:17–23
Jarvis J (1985) Approximating the equilibrium behavior of multi-server loss systems. Manage Sci 31:235–239
Kolesar PJ, Rider KL, Crabill TB, Walker WE (1975) A queuing-linear programming approach to scheduling police patrol cars. Oper Res 23:1045–1062
Larson RC (1974) A hypercube queueing model for facility location and redistricting in urban emergency services. Comput Oper Res 1:67–95
Larson RC (1975) Approximating the performance of urban emergency service systems. Oper Res 23:845–868
Larson RC (1979) Structural system models for locational decisions: an example using the hypercube queueing model. In: Haley KB (ed) Operational Research ’78, Proceedings of the Eighth IFORS International Conference on Operations Research. North-Holland Publishing, Amsterdam, Holland
Marianov V, ReVelle C (1995) In: Drezner Z (ed) Siting emergency services. Facility location: a survey of applications and methods. Springer, New York
Marianov V, ReVelle C (1996) The queueing maximal availability location problem: a model for the siting of emergency vehicles. Eur J Oper Res 93:110–120
Swersey AJ (1994) In: Pollock SM, Rothkopf MH, Barnett A (eds) The deployment of police, fire, and emergency medical units. Handbooks in operations research and management science, vol. 6: operations research and the public sector. North-Holland Publishing, Amsterdam, Holland
Toregas C, Swain R, ReVelle C, Bergman L (1971) The location of emergency service facilities. Oper Res 19:1363–1373
Willemain TR, Larson RC (eds) (1977) Emergency medical systems analysis. Lexington Books, Lexington, MA
Acknowledgment
This research was supported in part by the Natural Sciences and Engineering Research Council of Canada. We thank anonymous referees for several comments that led to improvements in the paper.
Author information
Authors and Affiliations
Corresponding author
Appendices
Appendix 1: Proof of Proposition 1
Recall that the system-wide coverage \(s\left( x \right) = \sum\nolimits_{j \in N} {h_j s_j \left( x \right)} \) is a convex combination of the coverages \(s_j \left( x \right)\) for each demand node j. To prove that s(x) is concave, it suffices to prove that the coverage \(s_j \left( x \right)\) for a particular node j is concave, since the weights \(h_j \) are positive. Therefore, we assume without loss of generality that there is only one demand node and we drop the demand node subscript j in the proof to simplify notation.
By assumption we have \(\Delta w_{i} = w_{{i + 1}} - w_{i} \leqslant 0\) for all i. We can express the probability \(f_i \left( x \right)\) as:
where \(g_i \left( x \right) = Q_i \prod\nolimits_{u = 1}^i {\rho _u^{x_u } } \) and \(g_0 \left( x \right) = 1\). Consequently,
with the understanding that \(w_{m + 1} = 0\).
The gradient of s(x) with respect to x has the following entries:
The entries in the Hessian matrix H are (assuming \(k \leqslant l\)):
Recalling that \(Q_i > 0\), \(\rho _i \in \left( {0,1} \right)\) and \(\Delta w_i \leqslant 0\), we see that \({{\partial s} \mathord{\left/ {\vphantom {{\partial s} {\partial x_k }}} \right. \kern-\nulldelimiterspace} {\partial x_k }}\) is non-negative for all k, and \({{\partial ^2 s} \mathord{\left/ {\vphantom {{\partial ^2 s} {\partial x_k \partial x_l }}} \right. \kern-\nulldelimiterspace} {\partial x_k \partial x_l }}\) is non-positive for all k and l.
Consider the quadratic form \(y^T Hy\) where y is an arbitrary column vector with m elements. This quadratic form can be expressed as:
Substituting the expression for \(h_{kl} \)we get:
By changing the order of summation, the double sum in Eq. 10 can be expressed as:
Similarly, the triple sum in Eq. 10 can be expressed as:
Substitution in Eq. 10 results in:
We see that each term in the outer summation is non-positive (because \(g_i \left( x \right) \geqslant 0\), \(\Delta w_i \leqslant 0\), and the squared summation is non-negative) and therefore \(y^T Hy \leqslant 0\) for all y. Consequently, H is negative semi-definite and s(x) is concave.■
Appendix 2: Estimating the average busy fraction
The average fraction of time that an ambulance is busy (not available to respond to calls) is \({{\lambda \tau } \mathord{\left/ {\vphantom {{\lambda \tau } z}} \right. \kern-\nulldelimiterspace} z}\), i.e., the average server utilization for a z-server queueing system, assuming that the number of calls “lost” due to queueing is negligible. The average “service time”, τ, (during which an ambulance is tied up with a call) can be broken down into the following components: average travel time to the call, average on-scene time, and average time spent traveling to and remaining at a hospital, denoted \(E\left[ {T_{{\text{to\; call}}} } \right]\), \(E\left[ {T_{{\text{on \;scene}}} } \right]\), and \(E\left[ {T_{{\text{hospital}}} } \right]\), respectively. Consequently, the average busy fraction can be expressed as \(\lambda {\left( {E{\left[ {T_{{{\text{tocall}}}} } \right]} + E{\left[ {T_{{{\text{onscene}}}} } \right]} + E{\left[ {T_{{{\text{hospital}}}} } \right]}} \right)}/z\). The arrival rate λ as well as two of the three components of the average service time, the average on-scene time and the average time spent traveling to and being at a hospital, are exogenous input. The average travel time to a call can be expressed as \(E\left[ {T_{{\text{to call}}} } \right] = \sum\nolimits_{j \in N} {h_j \sum\nolimits_{i \in S} {f_{ij} \left( x \right)E\left[ {T_{ij} } \right]} } \), where T ij is the travel time from i to j. This leads to the following formula for approximating ρ as a function of x:
The derivation of this formula required some approximations. In particular, we excluded the time spent traveling back to a station from the hospital from the average service time since the ambulance is available to respond to incoming calls during this time. On the other hand, our expression for \(E\left[ {T_{{\text{to \;call}}} } \right]\) assumes that all calls are responded to from an ambulance at a station.
Rights and permissions
About this article
Cite this article
Ingolfsson, A., Budge, S. & Erkut, E. Optimal ambulance location with random delays and travel times. Health Care Manage Sci 11, 262–274 (2008). https://doi.org/10.1007/s10729-007-9048-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10729-007-9048-1