Journal of Computational Engineering

Volume 2017 (2017), Article ID 2364254, 15 pages

https://doi.org/10.1155/2017/2364254

## Analysis of MCLP, Q-MALP, and MQ-MALP with Travel Time Uncertainty Using Monte Carlo Simulation

^{1}School of Distance Education, Universiti Sains Malaysia (USM), 11800 Gelugor, Penang, Malaysia^{2}School of Quantitative Sciences, UUM College of Arts and Sciences, Universiti Utara Malaysia (UUM), 06010 Sintok, Kedah, Malaysia

Correspondence should be addressed to Norazura Ahmad

Received 8 March 2017; Accepted 12 June 2017; Published 30 July 2017

Academic Editor: Fu-Yun Zhao

Copyright © 2017 Noraida Abdul Ghani and Norazura Ahmad. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

This paper compares the application of the Monte Carlo simulation in incorporating travel time uncertainties in ambulance location problem using three models: Maximum Covering Location Problem (MCLP), Queuing Maximum Availability Location Problem (Q-MALP), and Multiserver Queuing Maximum Availability Location Problem (MQ-MALP). A heuristic method is developed to site the ambulances. The models are applied to the 33-node problem representing Austin, Texas, and the 55-node problem. For the 33-node problem, the results show that the servers are less spatially distributed in Q-MALP and MQ-MALP when the uncertainty of server availability is considered using either the independent or dependent travel time. On the other hand, for the 55-node problem, the spatial distribution of the servers obtained by locating a server to the highest hit node location is more dispersed in MCLP and Q-MALP. The implications of the new model for the ambulance services system design are discussed as well as the limitations of the modeling approach.

#### 1. Introduction

In emergency medical services, a responsive and well-managed ambulance service is one of the key factors that can reduce fatality and suffering in patients. For emergency patients, each minute passed by will increase the severity of illnesses or injuries. Therefore, to provide a quick response, ambulances must be positioned at appropriate locations that can cover emergency demand within an acceptable response time. The response time is the most common measure of ambulance location performance, generally defined as the time between the dispatch of medical personnel and arrival of the personnel at the scene. It consists of the dispatch delay time plus the travel time to the scene. Yet, from the literature, some have also considered using the travel time as a surrogate for response time in alleviating ambulance location problem [1, 2]. This is a common practice and the most meaningful measure because the only component that is affected by changing the location of the ambulance is the travel time.

Traditional models have studied ambulance location model using constant travel time, with the assumption that travel time does not vary with time as there is no difference in velocity and speed [3–5]. However, in reality, there are variations in travel times and neglecting the variations could lead to an inaccurate estimation of the optimal ambulance fleet size. Variations in travel times from run to run would still occur even on an ambulance that traveled from a particular facility site using the same route repeatedly under essentially constant conditions such as same vehicle, driver, weather, and time of day. Thus, the uncertainty of ambulance travel time must be considered when doing analysis using travel time as a performance measure.

Studies on ambulance location problems have a long history in operations research. Among the many types of the ambulance location models in the literature, most of the models can be classified under the category of covering model. There are several types of covering model ranging from a simple to a more complex model such as the Location Set Covering Problem (LSCP) [6], Maximal Covering Location Problem (MCLP) [7, 8], Double Standard Model (DSM) [9], Maximum Expected Covering Location Problem (MEXCLP) [10], Maximum Availability Location Problem (MALP) [11, 12], Queuing Maximum Availability Location Problem (Q-MALP) [10], and Multiserver Queuing Maximum Availability Location Problem (MQ-MALP) [12] models. In all covering models, the aim is to find a set of optimal locations of facilities, such as ambulances, that can cover all or a maximum number of demand points, where coverage is defined similarly in some models while differently in others.

In this paper, with travel time used as a proxy to the response time, we consider the application of the Monte Carlo approach to incorporating travel times uncertainty in the Maximum Covering Location Problem (MCLP), Queuing Maximum Availability Location Problem (Q-MALP), and Multiserver Queuing Maximum Availability Location Problem (MQ-MALP) models All three models are applied to the 33-node problem representing Austin, Texas, and the 55-node problem.

The remainder of the paper is structured as follows. Firstly, some pertinent literatures on ambulance location models are presented. Next, a brief review of the MCLP, MALP, and the MQ-MALP models is provided. This is then followed by the Monte Carlo simulation of the MCLP, Q-MALP, and MQ-MALP with travel time uncertainty and the method used to site the ambulances. Analysis and discussion on the obtained results are in the subsequent section. Finally, a brief conclusion concludes the paper.

#### 2. Ambulance Location Models

Ambulance location models in the literature may be classified into two categories. The first, descriptive in nature, are the stochastic models which include queuing and simulation studies. They are generally used to determine the performance of a specified allocation and as such, it is often useful in addressing the tactical issues of the deployment of the vehicles. These approaches provide a richness of detail but they are also significantly more complex and require huge data.

The most well-known and comprehensive queuing model is the hypercube model created by Larson [13, 14]. In attempting to get a more accurate estimate for the probability of a vehicle being unavailable, Larson [13] developed a hypercube queuing model that considers the dependency among ambulances. Later, to reduce computational loads of the original model, Larson [14] created an approximate hypercube queuing model. The model can be used to assist planning by describing the consequences of a proposed change in terms of performance measures. Larson’s work was followed by many studies that were aimed at incorporating more realistic model features and integrating them into a probabilistic location model [15–17].

In terms of simulation model, one of the earliest applications to the ambulance location problem was by Savas [18]. Other simulation models were then developed in the context of medical facility or resource location problems by Fitzsimmons [19], Swoveland et al. [20], Berlin and Liebman [21], Uyeno and Seeberg [22], Goldberg et al. [23], Henderson and Mason [24], Gunes and Szechtman [25], and Aringhieri et al. [26]. These simulation models were commonly applied to evaluate the performance of solutions that were obtained from mathematical models. Unlike the analytical models, simulation models can evaluate rather complicated deployment strategies that do not require the restrictive assumptions frequently needed in analytical models. However, there are some practical challenges in simulation optimization such as the difficulty of evaluating optimality of obtained solutions and possibly long computation time that require considerable computer resources.

The second category of relevant literature is the family of deterministic location models based on a network. Prescriptive in nature, these models require less data and less computer time than the descriptive models. In this paper, the deterministic models are intensively reviewed since our implicit goal is to present a network based model that will fill a gap between the stochastic and deterministic models. The historical starting point of deterministic location model is the -median problem proposed by Hakimi [27]. The two main properties of the -median problem are the coverage distance that is unrestricted and the number of resources to be located is already identified [28]. The model seeks to locate facilities in such a way that the average response time is minimized. A major problem of this formulation is that solutions to these problems tended to burden some portion of the region with unacceptably long response times [29]. This problem led to the notion of “demand covering.”

There are two types of covering problem. One is to minimize the number of facilities to cover all demand points, while the other type aims at locating a limited number of resources that maximize the number of covered demand points. The first type is originally proposed by Toregas et al. [3], known as the Location Set Covering Problem (LSCP) which sought to position the minimum number of servers in such a way that each and every demand point on the network had at least one server initially positioned some distance or some standard time. However, as the nearest facility may not always be available at the time a demand call is received, the LSCP has been extended to locate a limited number of resources that maximize the number of covered demand points. Church and ReVelle [4] introduced the first maximum covering model known as the Maximal Covering Location Problem (MCLP).

The MCLP seeks the placement of a fixed number of servers so that the population or calls for service that have a server positioned within the standard would be maximized. There are a few extensions of MCLP that were applied to solve problems related to ambulance location. Some successful MCLP applications are the work done by Eaton et al. [30], who managed to solve ambulance location problem in Dominican Republic, and Dessouky et al. [31, 32] who studied large scale MCLP focusing on multiple quality levels and multiple quantities of the vehicles at the demand points. Other extensions of MCLP were also successfully applied on other areas such as gradual covering models by Berman et al. [33] and integrated GIS with MCLP by Alexandris and Giannikos [34].

The LSCP and MCLP, however, have a drawback; once a resource is requested for service, other demand points under its coverage are ignored and need to be catered by other resources. The drawback leads to the extensions and modifications of the basic model formulations. Two types of model were proposed to overcome the drawback. One type of the covering model aims to provide multiple coverage demand points by using more than one resource such as the Double Standard Model (DSM), introduced by Gendreau [5]. The DSM attempted to allot resources among potential sites using at least two vehicles to provide full coverage for longer distance standard while at the same time maximizing coverage within a shorter distance standard [35]. In the basic DSM model, demand is assumed equal for all nodes. However, Doerner et al. [36] modified and extended the basic DSM model by applying different capacity at the demand nodes.

The other type of the models attempted to take explicit account of the probabilities of servers being busy to compute the amount of redundancy actually needed, such as the MEXCLP by Daskin [37] and MALP by ReVelle and Hogan [38]. Daskin [37] extends the MCLP to account for the possibility that a server may be unable to respond to new demands. The objective of Daskin’s siting model was to maximize the expected population covered given a limited number of ambulances to be deployed. Later, ReVelle and Hogan [38] enhanced the MEXCLP by introducing the local estimate of the busy fraction, in the coverage area around node. Instead of maximizing expected coverage as in Daskin, they constrained the level of server availability to be greater than or equal to a preset value, while minimizing the total number of servers. The model, known as the Probabilistic Location Set Covering Problem (PLSCP), was essentially a version of the LSCP with a probabilistic constraint.

Before long realizing that solution to the PLSCP could lead to a large number of servers, potentially larger than what available funds could achieve, ReVelle and Hogan [38] formulated the Maximum Availability Location Problem (MALP). It sought to maximize the population which had a service available within a stated travel time with a specified reliability, given that only servers are to be located. The number of servers needed for -reliable coverage of node is computed using the same reasoning as in PLSCP. Other researchers also modified and enhanced the MEXCLP and PLSCP to tackle other EMS location problems such as MOFLEET [39], AMEXCLP [40], and TIMEXCLP [41].

The preceding models discussed so far made an assumption that the probabilities of two vehicles being busy within the same region are independent. Batta et al. [40] relaxed the independence assumption through the use of Larson’s approximated hypercube while still maintaining the system-wide busy fraction. Marianov and ReVelle [42], on the other hand, use the region-specific busy fraction in their model. They formulated the Queuing-MALP (Q-MALP) in which the assumption of independence of server availability is relaxed and modeled the behavior of each region as an M/M/s/s queuing system (Poisson arrivals, exponentially distributed service time, servers, and up to calls being serviced at the same time). They later modified the model to include the general service time distribution [43]. Noraida [12] later extended the Q-MALP model by developing the MQ-MALP that considers two types of demand (critical and noncritical) with two types of servers, that is, advanced life support (ALS) and basic life support (BLS). Though the BLS is not equipped with ALS capabilities, this unit acts as a backup for the ALS in providing coverage to critical calls. In addition, her model takes into account the stochastic nature of the travel times.

Other studies of ambulance location problem were also aware of the importance of taking into account the uncertainty in the travel times, as it will significantly influence the quality of the achieved solution. Mirchandani and Odoni [44] extended the -median problem to account for stochastic travel times. Their model assumes travel times to be known when a demand for service arises; however, the state of the system (as described by the link travel times) changes over time according to a Markov process. Daskin [45] formulated a multiobjective model that simultaneously determines the number of vehicles to deploy and their locations and identifies the appropriate dispatch policy and the routes vehicles should use in traveling to emergency locations. His model accounts for the effects of travel time variability on the system performance measures.

#### 3. MCLP, Q-MALP, and MQ-MALP Models

In covering models, a demand is considered covered if at least one vehicle can serve the emergency call within a standard distance. As stipulated in the EMS Act of 1973, the standard distance required that 95% of demand calls in urban areas should be reached within 10 minutes, whereas in rural areas the calls should be reached not more than 30 minutes. Adhering to the Act, many studies of ambulance location problem had applied covering models. In this section, we provide further description on the MCLP, Q-MALP, and the MQ-MALP as the direction of this paper is based on these three models.

##### 3.1. MCLP Model Formulation

Church and ReVelle [4] introduced the MCLP to modify the assumption of unlimited resources to serve the demand as considered in the LSCP. The MCLP is formulated to maximize the number of demands that can be covered within the desired service distance or time given a limited number of facilities. A demand is considered covered if there is at least one ambulance stationed within some distance away. The MCLP does not consider server availability; hence, it is assumed that once stationed, the ambulance is always available. The model can be stated as follows:where is set of demand nodes (indexed by ), is set of eligible facility sites (indexed by ), is shortest time from potential facility site to demand node , is time or distance standard for coverage, is demand at node . ; that is, is the set of nodes located within the time or distance standard of demand node or the neighborhood of . If a call for service originating at this node is answered by available servers stationed inside this neighborhood, it will be answered within the time or distance standard.

##### 3.2. Q-MALP Model Formulation

Marianov and ReVelle [43] introduced the queuing maximal availability location problem (Q-MALP) that relaxes the assumption that the probability of different servers being busy is independent. In the model, the arrival and servers activities within the neighborhood were treated as M/G/s-loss queuing system. The model allows dependency busy fraction between different servers at a local neighborhood. Using queuing theory, , the smallest number of vehicles that must be located to cover demand point with reliability coverage can be computed. In the Q-MALP model, a demand is considered covered if there is at least one ambulance stationed within some distance away. However, once stationed, the ambulance is not always available to respond as it might be servicing other demands or it might be down or under repair and server availability is dependent on other servers in the system. The model can be formulated as follows:where is set of demand nodes (indexed by ), is set of eligible facility sites (indexed by ), is shortest time from potential facility site to demand node , is time or distance standard for coverage, is reliability of a server, ; that is, the set of demand nodes located within of node or the neighborhood of , ; that is, the set of potential facility sites located within of node or the neighborhood of , is arrival rate (calls/day), is service rate (calls/day), , is the smallest integer satisfying

##### 3.3. MQ-MALP Model Formulation

Noraida [12] developed the MQ-MALP to reflect two categories of ambulance, the advanced life support (ALS) and basic life support (BLS). ALS ambulances are manned by paramedic and are equipped to handle life-threatening demands such as cardiac resuscitation and airway management. BLS ambulances provide services for noncritical problems that are managed by emergency medical technician (EMT). The BLS also plays a role as a “backup” for the ALS in providing coverage to critical calls. A call of noncritical nature is considered covered if there is at least one ALS/BLS unit stationed within time standard with -reliability. Likewise, a call of critical nature is considered covered if there is at least one ALS stationed within time standard with probability . The concept of coverage in the MQ-MALP is discussed in detail by Noraida [12].

The model can be stated as follows:where is set of demand nodes (indexed by ), is set of eligible facility sites (indexed by ), is shortest time from potential facility site to demand node , is time standard for coverage of critical calls, is time standard for coverage of noncritical calls, is demand of critical nature at node (number of calls per day), is demand of noncritical nature at node (number of calls per day), is reliability of a server, is the minimum number of EMS (ALS or BLS) units which must be located within unit of node for node to be covered with reliability , precomputed using is the minimum number of BLS units which must be located within unit of node for node to be covered with reliability, precomputed using is number of available ALS units to locate, is number of available BLS units to locate, is capacity of site .

are the weights associated with each objective:

To account for the stochastic nature of the travel times, the above MQ-MALP model formulation was extended by incorporating a probabilistic measure in and as explained in Section 4.

It is better to calculate the average duration of critical call originating from demand node . However, as data is not collected at that level, is used as an estimate instead. This is where the assumption [see Marianov and ReVelle [43]] of treating the demand neighborhoods as self-containing comes into play.

As indicated by Figure 1, this assumption may not be consistent as it is possible that facility node is part of the response area of demand node as well as of demand node . Averaging with respect to critical calls to demand node (i.e., calculate ) would improve the apparent inconsistency as this average would take into account the fact that responses to critical calls originating at demand node are delayed because servers at facility node are also responding to demand node . However, even with this adaptation the minimum number of servers required calculated in our model would still be a lower bound on the number that is actually needed to arrive at this reliability due to the self-containment assumption of demand node .