Performance Evaluation of Tehran-Qom Highway Emergency Medical Service System Using Hypercube Queuing Model

Size: px
Start display at page:

Download "Performance Evaluation of Tehran-Qom Highway Emergency Medical Service System Using Hypercube Queuing Model"

Transcription

1 Western New England University From the SelectedWorks of Mohammadsadegh Mobin Summer May 2, 2015 Performance Evaluation of Tehran-Qom Highway Emergency Medical Service System Using Hypercube Queuing Model Mohammadsadegh Mobin, Western New England University Zhaojun Li, Western New England University Maghsoud Amiri Available at:

2 Proceedings of the 2015 Industrial and Systems Engineering Research Conference S. Cetinkaya and J. K. Ryan, eds. Performance Evaluation of Tehran-Qom Highway Emergency Medical Service System Using Hypercube Queuing Model Mohammadsadegh Mobin, Zhaojun Li Western New England University, MA, USA Maghsoud Amiri Allameh Tabataba i University, Tehran, Iran Abstract This paper studies the ambulance deployment of the Tehran-Qom highway emergency medical service (EMS) system. The response time of EMS to an emergency call can have impact on the users in terms of the life and death, and this performance metric is evaluated using the proposed hypercube queuing model. The model is based on spatially distributed queuing theory and Markovian analysis approximations, and it is one of the most effective approaches for analyzing emergency response systems. In this research, performance measures of the EMS including workloads and mean response times are evaluated using the hypercube model. Modification to the existing system configuration is applied to improve the system performance. We also analyze the effects of small variation in the system inputs, such as user demands rates, to investigate the robustness of the outputs. The results demonstrate the effectiveness of the proposed model in supporting design and operational decisions, in particular in reducing the ambulances workload imbalances as well as mean user response time. Keywords Ambulance Allocation Problems, Hypercube Queuing Model, Emergency Medical Service (EMS) Notations N: Number of servers (in this problem is equal to number of facilities) N A : Number of atoms K: Set of all system states ( K =2 N ) f nj : The fraction of all dispatches that send ambulance n to atom j (n = 1,2,, N) N A λ: Total rate of demand (λ = j=1 λ j ) λ j : Demand rate in atom j(j = 1,2,, N A ) μ i : Service rate for server i (i = 1,2,, N) P B : The equilibrium probability of state B P p : System loss probability (probability of losing demand) τ ij : The mean ambulance travel time between atoms i and j ρ i : Workload of ambulance i f nj : The fraction of all dispatches that send ambulance n to atom j E nj : The set of states in which ambulance n is assigned to any service request from atom j TU n : Mean travel time for ambulance n T: Overall mean travel time T j : Mean travel time to atom j F n : Fraction of all dispatches of each server that send to other atoms. 1. Introduction Recent increment in costs of medical services, increasing call volumes and worsening traffic conditions on highways are making ambulance location allocation problems as one of the most important issues on emergency medical service (EMS) management. Designing ambulance operations refers to any system-status management approaches by which a dispatcher repositions idle ambulances in order to compensate for others that are unavailable or districting the area that ambulances can cover. The main purpose of designing or modifying the configuration of emergency response

3 systems is to keep the balance between the benefits of improving system (e.g. shorter mean response time, fewer lost calls, better quality of clinical, pre-hospital care, etc.) and the expenses of increasing the investment (e.g. more ambulances, stations, better training of personnel, improved screening of calls) in the system. Furthermore, EMS providers face the problem of allocating a fixed number of ambulances among a set of bases with the objective of ensuring adequate coverage and reasonable response times in an emergency situation. The response time of a call is the elapsed time from when the call is received to when an ambulance arrives at the scene of accident. The mean user response time is usually considered as the main performance measure and the EMS providers are usually interested in minimizing the fraction of the lost calls and the calls with response time longer than some threshold, which is usually considered around ten minutes in the literature [1-4]. The reasons for lost calls and excessive delays in the response time are the conflict between randomly occurring service requests and occasional unavailability of the closest ambulances. The balance of ambulance workloads, the fraction of calls not serviced by the EMS (loss probability), and the fraction of calls not serviced within a predetermined threshold (i.e., fraction of calls with response times exceeding T minutes) are commonly used performance measures to evaluate the EMS systems. In this study, we analyze the ambulance deployment of an EMS located in portion of the Tehran-Qom highway which connecting the capital city of Iran, Tehran and the city of Qom. We only considered the portion of the highway which is in Tehran province territory and cover by the Tehran Emergency Center. Five ambulances are located in five fixed bases along the highways in this EMS system. The operations center, located in the Tehran Emergency Center, handles the calls and dispatches the ambulances. In this highway EMS system, immediately after receiving an emergency call, an ambulance goes to the place of accident and provides the first medical treatment to the individuals involved in an accident, transports them to the nearest hospital (if necessary), and then goes back to its home base on the highway. These systems are typically zero-line capacity, and they operate within particular ambulance dispatching policies. It means that only predefined ambulances can be dispatched to the specific region on the highway (partial backup), mainly due to the limitations of travel distance and time. The resulting system can be conceptualized as a spatially distributed multi-server loss queueing system, with a specific and limited dispatching policy, which follows the assumptions of the basic hypercube model developed by Larson [5], the well-known and effective descriptive model for evaluating the server-to-customer systems. The hypercube model is based on spatially queuing theory and Markovian analysis approximation. The basic idea is to expand the state space description of a simple multi-server queueing system (e.g. M/M/N, where N is the number of servers) in order to represent each server individually and incorporate reasonably complex dispatching policies [5,6]. In the literature, hypercube model has been extensively applied. Examples of applications of the hypercube model in urban EMS system can be found in [7-10]. Some studies have extended the original hypercube model for application to EMS systems on highways. For example, Mendonça and Morabito [2] extended hypercube queuing model with partial backup dispatching, Iannoni and Morabito [11] modified hypercube queuing model to consider multiple dispatching of different types of servers, Atkinson et al. [12] proposed a hypercube queuing loss model with customerdependent service rates. Davoudpour et al. proposed a new probabilistic coverage model for ambulances deployment with hypercube queuing approach [13]. Other studies combining exact and approximate hypercube models with optimization procedures to solve probabilistic location problems have been reported. For example, Iannoni et al. [4] integrated a multiple dispatch partial backup hypercube model into a genetic algorithm (GA) in order to determine the optimal response areas for the ambulances. Geroliminis et al. [14] proposed a hybrid hypercube-genetic algorithm approach for deploying many emergency response mobile units in an urban network. Iannoni et al. [15] extended this approach to optimize the location of the ambulances and their corresponding coverage areas (districts). Their approach is known as a location and districting GA/hypercube algorithm. In this paper, we applied the Hypercube model developed by Mendonça and Morabito [2] to evaluate the performance of Tehran-Qom EMS system with partial backup and zero-line capacity. Geographical and temporal complexities of the region are considered in the model we applied. The applied model requires the solution of linear systems of k(2 N ) equations, where the variables involved are the equilibrium state probabilities of the system. After obtaining the steady-state distribution, some performance measures such as server workloads, mean server response times etc. are calculated to evaluate the performance of this EMS system. After modifying the current configuration of the EMS system the performance measures of system such as workload unbalancing are improved. This study is the first highway ambulance deployment study in Iran which is partially supported by Tehran Emergency Center.

4 The paper is organized as follow: Section 2 presents a brief description of Hypercube model and discusses how it can be adopted to evaluate the EMS systems. In section 3, the hypercube model is applied in Tehran-Qom highway and performance measures of EMS system are calculated. An alternative configuration of the system is presented in Section 4. The effects of small variations in the system performance are presented in section 5 and finally, in section 6, concluding remarks and perspective for future research are presented. 2. Hypercube model in ambulance deployment Ambulance deployment methodologies which have received a great deal of attention in the literature can be categorized into two primary areas including prescriptive and descriptive methods [16]. Prescriptive methods search over all possible ambulance allocations to identify a subset of allocations and they typically use simplified performance measures to allow for efficient search procedures. Important early work on prescriptive models includes Toregas et al. [17] and Church and ReVelle [18]. Descriptive methods complement prescriptive methods by providing the ability to carefully evaluate a proposed ambulance allocation. These models provide more accurate estimates for quantities such as the utilizations of the ambulances and the probability that the response time is longer than predefined threshold. This area is dominated by the hypercube method proposed by Larson [5] and its extensions such as [19-23]. The name hypercube derives from the state space of the system. For the zero-line capacity system, it can be described as the vertices of the N-dimensional unit hypercube in the positive orthant and each vertex corresponds to a particular combination of serves status [5]. In this approach, each emergency response unit is modeled as a server with two possible statuses: idle (0) or busy (1) at any given instant, there are 2 N possible states to the system. A particular state of the system is given by the entire listing of ambulances that are free and busy. For example, the state 101 corresponds to a 3-server-system, with servers 1 and 3 busy and server 2 idle, and the state space is given by the vertices of a cube. If the system has more than 3 ambulances, we have a hypercube. 3. Implementing hypercube Queuing model in Tehran Qom highway In this section, we applied hypercube model which presented by Mendonca and Morabito [2] in order to evaluate the performance of EMS system on Tehran- Qum highway. This system has 2 5 states in which 5 represents number of servers in system. For example, vector (10011) shows a state of system in which third and fourth servers are ideal (from right to left) and another servers are busy. A sample data which was taken in summer 2009 is obtained from the Tehran Emergency Center. We considered the summer period for our study, since the EMS system has higher rate of EMS calls. In the following section, the main assumptions of the partial backup and multiple dispatch hypercube model for application on highways are presented. The validity of these assumptions in Tehran-Qum highway EMS problem is verified as well Assumptions In Mendonca and Morabito hypercube model [2], the highway is divided into N A geographical areas (segments of highway) or atoms, which corresponds to independent sources of calls and there are N spatially distributed ambulances, which can travel to any atom. Each ambulance, when idle, stays in its base waiting for a call. In Tehran- Qum highway, there are 7 atoms and 5 ambulances located in the predefined station. Each station (Fixed Base) has one ambulance and its personnel (doctor, rescuers, and driver) that always move together. The enumeration of the five bases of the Tehran-Qom highway is defined in Figure1. Figure1. Atoms and stations (Fixed base) along the Tehran-Qom highway In each atom j calls arrive according to a Poisson process, independently from the other atoms, with mean arrival rate λ j (j = 1,2, N A ). Table 1 shows the statistics of the arrival process for each atom. The number of events, mean interval time, standard deviation, coefficient of variation and arrival rate ( λ j ) are calculated with the data given by

5 Tehran Emergency Center. In order to verify the hypothesis of independent Poisson arrivals, we applied the chi-square and Kolmogorov-Smirnov test and the result shows the for all atoms the test were unable to reject the hypothesis with 5% of confidence level (Table 2) Atom j Number of events Table 1. Statistics of the arrival process for each atom Mean interval Standard Coefficient of time (min) deviation (min) variation Arrival rate λ j (min -1 ) In this system, there is a server dispatch preference list for each atom. If the first preference ambulance of the list is available in its base, it is dispatched; otherwise, the next ambulance of this list (backup) is dispatched. This list is fixed a priori and remains unchanged during the operation of the system. In response to each call, exactly one ambulance is dispatched from its base to the locale of the accident. If the two nearest ambulances to this local are not available, the call is lost (e.g. it is transferred to a local EMS). The predefined first and second preference ambulances for each atom in Tehran-Qum EMS system is presented in Table 2. For example, the eastern part of the Kahrizak region (Atom 3) has ambulance B as a first preference and ambulance C as backup. Table2. First and second (backup) preference ambulances for each atom Atom First preference ambulance Second (backup) preference ambulance 1 1 (A) 2 (B) 2 2 (B) 1 (A) 3 2 (B) 3 (C) 4 3 (C) 4 (D) 5 4 (D) 3 (C) 6 4 (D) 5 (E) 7 5 (E) 4 (D) The mean ambulance travel time (τ ij ) between atoms i and j should be known or can be estimated using geometrical probability concepts. In this study, these times are estimated based on travel time between atoms with average speed in Tehran-Qom highway. Figure2. The mean travel time (τ ij ) and the distance between atoms The service time for a call includes the setup time, the travel time from the base to the location of the accident, the time spends on-scene, and the travel time back to the base. The ambulances have mean service times μ 1, μ 2,, μ n that can be different. In this hypercube model it is assumed that the standard deviation of the service time is approximately equal to the mean, since the mathematical analysis assumes negative exponential service times. However reasonable deviations from this assumption have been found not to alter the accuracy of the model, as mentioned in [2] and [6]. In order to verify the validity of this assumption, we applied the chi-square, Kolmogorov-Smirnov test and the results

6 show that for all bases the test was unable to reject the hypothesis of negative exponential service time with 5% of confidence level (Table 3). Base n Number of services Table3. Statistics of the service process for each base Mean service time (min) Standard deviation (min) Coefficient of variation service rate μ i (min -1 ) Equilibrium state probabilities Relations among states of a queuing system can be illustrated by rate diagram. In rate diagram, nodes represent state of system and branches show possibility of transition from one state to other state. Figure 3 illustrates the flows into and out of state (01001). In this rate diagram when fourth base (base D) provides a service with rate of μ 4, state of the system changes from (01001) to (00001). Also, when system changes from (00001) to (01001) means that fifth and sixth atoms have demand for fourth base. Rate diagram can be interpreted for other branches with respect to priority of each base. Figure3. Flows into and out of state The equilibrium probability equations are defined supposing that the system attains steady state. For each of the 32 states of the system, the flow into the state (the probability of the system being in another state times the transition rate from that to the current state) should be equal to the flow out of the state (the probability of the system being in the state, times the transition rate from this to other state). For example, for state (01001), equilibrium equation is equal to Equation (1) with respect to rate diagram (Figure3). (μ 2 )P (μ 3 )P (μ 5 )P (λ 1 )P (λ 5 + λ 6 )P (1) = (λ 1 + λ 2 + λ 3 + λ 4 + λ 5 + λ 6 + λ 7 + μ 1 + μ 4 + μ 5 )P With substituting any of the 32 equations by P B = 1 B (the sum of all state probabilities should be equal to 1), a determined system with 32 linearly independent equations is obtained. Solving this determined system offers equilibrium probabilities for each state (Appendix 1). By using these probabilities some performance measures of EMS system are computable which are presented in next section Performance measures Different interesting performance measures for the analysis of the EMS system can be defined as a function of the equilibrium distribution, as discussed in [5] and [6]. In this stage some performance measures are calculated. The results of computations for all performance measures are presented in Table 5. Workload of ambulance i (ρ i ): The amount of workload of ambulance n is fraction of times in which ambulance n is busy (Equation 2). ρ i = B: server i is buzy P B (2) For example workload of ambulance 1 is calculated as ρ 1 = B: server 1 is buzy P B = P P P P P P P P P P P P P P P P Amount of imbalances in workload of servers ( W): This amount is equal to difference between the workload of each ambulance and average workload of ambulances (Equation 3). W = ρ mean ρ i (3)

7 System loss probability (P p): This probability is calculated by considering state of ambulance in facing with each demand of different atoms. For example first term of Equation 4 shows the time that first and second servers are busy and there is a demand from atoms 1 or 2. P p = ( λ 1+ λ 2 λ P P ) + ( λ 4+ λ 5 λ P ) + ( λ 6+ λ 7 λ P P ) + ( λ 1+ λ 2 + λ 3 λ P ) + ( λ 3+ λ 4 + λ 5 λ ) ) + ( λ 4+ λ 5 + λ 6 + λ P ) + ( λ 1+ λ 2 + λ 6 + λ ) + ( λ 2+ λ 3 + λ 4 + λ 5 λ λ ( λ 3+λ 4 + λ 5 + λ 6 + λ 7 λ ) + P The fraction of all dispatches that send ambulance n to atom j (f nj ): This amount is presented in Equation 5. λ j f (5) nj = λ B E P nj B 1 P p where E nj is the set of states in which ambulance n is to be assigned any service request from atom j. For example, E 11 can be calculated as E 11 : {(00000), (00100), (01000), (11100), (10000), (00010), (00110), (01010), (10010), (01110), (10110), (11010), (11110)} and E 12 can be calculated as E 12 : {(00010), (00110), (01010), (10010), (01110), (10110), (11010), (11110)}. It should be noted that Equation 5 is a slight modification of the formula in Larson and Odoni [6], since state in not the unique state in which the system can lose a call, but any state with two or more adjacent busy ambulances. Therefore, the denominator of Equation 5 is 1 P p instead of 1 P By substitution whole demand (λ= ) in Equation 5, the amount of f nj is calculated for each travel (Table 4). λ (4) Table 4. Fraction f nj f 11 = f 21 = f 23 = f 34 = f 45 = f 35 = f 57 = f 12 = f 22 = f 33 = f 44 = f 46 = f 56 = f 47 = Mean travel time for ambulance n (TU n ): This parameter is equal to mean travel time for ambulance n to arrive in accident location (Equation 6). TU n = N A j=1 f njt nj N A f nj j=1 where t nj for each travel is equal to mean travel time for ambulance n to atom j (note that t nj is easily calculated from the mean inter-atom travel times τ ij ). Besides of this, with respect to data in mission form of each servers and comments of experts in Tehran Emergency Centers, set-up time after each emergency call for preparing each ambulance is considered as 5 minutes, which is added to mean travel time for ambulance and makes parameter t nj. For example mean travel time for ambulance 4 is calculated as: TU 4 = (f 44 t 44 )+ (f 45 t 45 )+ (f 46 t 46 )+ (f 47 t 47 ) (f 44 + f 45 + f 46 +f 47 ) Overall mean travel time (T): This amount can be calculated using Equation 7. T = N N A n=1 i=1 f nj t nj (7) Mean travel time to atom j (T j ): Mean travel time for ambulances to each atom can be calculated as Equation 8. T j = n=1 f njt nj N n=1 f nj For example, this amount can be calculated for district 6 as T 6 = (f 46 t 46 )+ (f 56 t 56 ) (f 46 + f 56 ) Fraction of all dispatches from district, to other atoms (F j ): This parameter is calculated by using Equation 9. F j = N j i { i:i is in district} N j=1 { i:i is in district} For example for atom 5, fraction of all dispatches to other atoms is calculated as: F 5 = f 45 + f 35 Fraction of all dispatches of each server that send to other atoms (F n ): This parameter can be calculated as Equation 10. F n = f nj f nj {j:j is out of district} f nj N A j=1 f nj f 35 (6) (8) (9) (10)

8 For example fraction of all dispatches that server 3 sent to other district is as: F 3 = f 33+ f 35 f 33 + f 34 + f Alternative scenarios In this section we modify the configuration of the system in order to improve workload balancing among bases. As shown in Table 5, the system is not balanced since the workload of base 2 is significantly higher than the others. An alternative that does not involve additional investments is to reduce the size of atoms for which the ambulance in base 2 is first preference. Figure 4 depicts the particular case where we simply decreased the size of atom 2 to reduce the workload of base 2. This change is suggested by experts of Tehran Emergency Center. Figure 4. Original and modified size of atoms 1 and 2. In this step, we repeated all steps of research and compared some performance measures of system for original and modified systems. The results are presented in Table 5, 6, and 7. Base n mean service rate μ i (min -1 ) O.S M.S Sum= Table 5: Result of balancing for each base Workload ρ n Imbalances in workload( W) O.S M.S O.S M.S (O.S: Original System, M.S: Modified System) Mean travel time (TU n) O.S M.S Fraction (F n) O.S M.S Atom j mean Table 6: Result of balancing for each atom Length (km) Arrival rate λ j Mean travel time to (min -1 ) atom j (T j) O.S M.S O.S M.S O.S M.S Sum= (O.S: Original System, M.S: Modified System) Fraction (F j) O.S M.S Original system Table 7: Result of balancing in whole system T mean P P

9 Modified system Mobin M., Li Z., Amiri M By changing system state, workload of ambulance 2 (ρ 2 ) decreased about percent (Table 5). Changing size of atoms had negligible effects on workload of other ambulances, and decreased the average workload of other ambulances. This change also decreased average workload of all ambulances about percent and workload imbalances of whole system about percent. Furthermore, by changing size of district, mean travel time for ambulance n (TU n ) is decreased, except ambulance 1 which is increased because of increasing size of atom. In addition, the average of TU n declined from to minutes. In modified system, fraction of all dispatches that send backup ambulance to other atoms decreased from to Besides of this, by comparing real system state with recommended system, the mean travel time to atoms (average of T j ) declined from to that shows improvement of EMS system. In addition, the average fraction of all dispatches to each atom from other atoms (average of F j ) decreased from to (Table 8). Finally as seen in Table 7, mean travel time of system (T) decreased from to This change is negligible because of the little modification in size of atom, which does not need any additional investment. Undoubtedly, this amount will be more decreased, by making more changes in atoms, more investments for making new station and adding more ambulances. Also, System loss probability (P P ) decreased to which shows improvement of EMS system. 5. Sensitivity analysis In order to analyze how the current system configuration would perform in a situation with different amount of demand, we increase the mean arrival rate λ j, j = 1,2,, N A, by 10%, 20%,, 50%, 10%, 200%, and 500% and show effects of increasing demand on the probability of an empty system (P ), the loss probability (P p ), and the overall mean travel time (T) (Table 10).These result are presented in Figures 5, 6 and 7. By applying the similar method of analyses, the effect of other input parameters rather than the arrival rates can be evaluated. As shown in Figure 5, the mean travel time of the system is relatively robust whit respect to variations in the demand. This is because the system does not allow queues. Note that if we double the demand (100%), the mean travel time will increase from min to only min; however, the probability of an empty system will fall from 0.668% down to less than 0.453% (Figures 5 and 7), while the loss probability will jump from 0.031% to more than 0.067% (Figure 6). Figure 5. Effects of increasing demand on the overall mean travel time (T) Figure 6. Effects of increasing demand on the loss probability (P P) Figure 7. Effects of increasing demand on the probability of an empty system (P )

10 Table 10: Effects of increasing demand on the probability of an empty system (P ), loss probability (P P) and overall mean travel time (T) Increase of T TU P demand (%) p P n (mean) T (00000) F (min) (min) n (mean) F n (mean) j (mean) (min) Conclusion In this research, we evaluated the EMS system on Tehran-Qom highway by means of hypercube model. By calculating the equilibrium state probabilities of the EMS system, some performance measures of system including workload of ambulances, system loss probability, mean travel time etc. are calculated. By applying some practical modifications in the EMS system without requiring additional investments in the system, such as modifying the size of atoms, the performance of the system is recalculated and compared with the performance measures of original system. The results show the improvement in performance measures of modified EMS system. The mean travel time of the modified system reduced to 7.55 min which is close to the standards reported by other studies in literature. As another performance measures, we obtained the loss probability of system which means the modified system will loses 0.031% of the arriving emergency calls. We also analyzed the effects of small variations in the input parameters of the model, such as user demand, to investigate the robustness of the model. The amount of mean travel time is reasonably robust with respect to variations in the demands, since the system does not allow queues. Applying integrated Hypercube and optimization models to deal with EMS on highways involving different operational policies (e.g., different dispatch preference lists, multiple dispatches of ambulances, and dynamic relocation of ambulances) can be considered as a future research. Finally, the methods could be extended to examine urban EMS, which usually correspond to large systems in moderate to large cities. Furthermore, applying Discrete Event Simulation models to calculate system performance measures when queuing models are difficult or impossible to apply are recommended as future researches. Appendix 1: Equilibrium state probabilities P = P = P = P = P = P = P = P = P = P = P = P = P = P = P = P = P = P = P = P = P = P = P = P = P = P = P = P = P = P = P = P = References 1. Fujiwara, O., Makjamroen, T., and Gupta, K. K., 1987, Ambulance Deployment Analysis: a Case Study of Bangkok. European Journal of Operational Research, 31(1), Mendonça, F. C., and Morabito, R., 2001, Analyzing Emergency Medical Service Ambulance Deployment on a Brazilian Highway Using the Hypercube Model. Journal of the Operational Research Society, Takeda, R. A., Widmer, J. A., and Morabito, R., 2007, Analysis of Ambulance Decentralization in an Urban Emergency Medical Service Using the Hypercube Queueing Model. Computers and Operations Research, 34(3),

11 4. Iannoni, A. P., Morabito, R., and Saydam, C., 2008, A Hypercube Queueing Model Embedded into a Genetic Algorithm for Ambulance Deployment on Highways. Annals of Operations Research, 157(1), Larson, R. C., 1974, A Hypercube Queuing Model for Facility Location and Redistricting in Urban Emergency Services. Computers and Operations Research, 1(1), Larson, R. C., and Odoni, A. R., 1981, Urban Operations Research, (No. Monograph). 7. Chelst, K. R., and Barlach, Z., 1981, Multiple Unit Dispatches in Emergency Services: Models to Estimate System Performance. Management Science, 27(12), Galvao, R. D., and Morabito, R., 2008, Emergency Service Systems: The Use of the Hypercube Queueing Model in the Solution of Probabilistic Location Problems. International Transactions in Operational Research, 15(5), Morabito, R., Chiyoshi, F., and Galvão, R. D., 2008, Non-Homogeneous Servers in Emergency Medical Systems: Practical Applications using the Hypercube Queueing Model. Socio-Economic Planning Sciences, 42(4), Iannoni, A. P., Morabito, R., and Saydam, C., 2011, Optimizing Large-Scale Emergency Medical System Operations on Highways Using the Hypercube Queuing Model. Socio-Economic Planning Sciences, 45(3), Iannoni, A. P., and Morabito, R., 2007, A Multiple Dispatch and Partial Backup Hypercube Queuing Model to Analyze Emergency Medical Systems on Highways. Transportation Research Part E: Logistics and Transportation Review, 43(6), Atkinson, J. B., Kovalenko, I. N., Kuznetsov, N., and Mykhalevych, K. V., 2008, A Hypercube Queueing Loss Model with Customer-Dependent Service Rates. European Journal of Operational Research, 191(1), Davoudpour, H., Mortaz, E., and Hosseinijou, S. A., 2014, A New Probabilistic Coverage Model for Ambulances Deployment with Hypercube Queuing Approach. The International Journal of Advanced Manufacturing Technology, 70(5-8), Geroliminis, N., Kepaptsoglou, K., and Karlaftis, M. G., 2011, A Hybrid Hypercube Genetic Algorithm Approach for Deploying Many Emergency Response Mobile Units in an Urban Network. European Journal of Operational Research, 210(2), Iannoni, A. P., Morabito, R., and Saydam, C., 2009, An Optimization Approach for Ambulance Location and the Districting of the Response Segments on Highways. European Journal of Operational Research, 195(2), Swersey, A. J., 1994, The Deployment of Police, Fire, and Emergency Medical Units. Handbooks in Operations Research and Management Science, 6, Toregas, C., Swain, R., ReVelle, C., and Bergman, L., 1971, The Location of Emergency Service Facilities. Operations Research, 19(6), Church, R., and Velle, C. R., 1974, The Maximal Covering Location Problem. Papers in Regional Science, 32(1), Jarvis, J. P., 1975, Optimization in Stochastic Service Systems with Distinguishable Servers, (Doctoral dissertation, Massachusetts Institute of Technology). 20. Jarvis, J. P., 1985, Approximating the Equilibrium Behavior of Multi-Server Loss Systems. Management Science, 31(2), Berman, O., and Larson, R. C., 1982, The Median Problem with Congestion. Computers and Operations Research, 9(2), Goldberg, J., and Szidarovszky, F., 1991, Methods for Solving Nonlinear Equations Used in Evaluating Emergency Vehicle Busy Probabilities. Operations Research, 39(6), Wright, P. D., Liberatore, M. J., and Nydick, R. L., 2006, A Survey of Operations Research Models and Applications in Homeland Security. Interfaces, 36(6),

Facility Location Problem for Emergency and On-Demand Transportation Systems. Burak Boyacı Nikolas Geroliminis

Facility Location Problem for Emergency and On-Demand Transportation Systems. Burak Boyacı Nikolas Geroliminis On-Demand Transportation Systems Burak Boyacı Nikolas Geroliminis STRC 22 January 22 On-Demand Transportation Systems January 22 STRC 22 Facility Location Problem for Emergency and On-Demand Transportation

More information

Fernando Chiyoshi 1, Ana Paula Iannoni 2 and Reinaldo Morabito 3*

Fernando Chiyoshi 1, Ana Paula Iannoni 2 and Reinaldo Morabito 3* Pesquisa Operacional (0) (): 7-99 0 Brazilian Operations Research Society Printed version ISSN 00-748 / Online version ISSN 678-54 www.scielo.br/pope A TUTORIAL ON HYPERCUBE QUEUEING MODELS AND SOME PRACTICAL

More information

Analysing emergency medical service ambulance deployment on a Brazilian highway using the hypercube model

Analysing emergency medical service ambulance deployment on a Brazilian highway using the hypercube model Journal of the Operational Research Society (2001) 52, 261±270 #2001 Operational Research Society Ltd. All rights reserved. 0160-5682/01 $15.00 www.palgrave.com/jors Analysing emergency medical service

More information

Spatially Distributed Queues II. M/G/1 2 Servers N servers: Hypercube Queueing Model Approximations

Spatially Distributed Queues II. M/G/1 2 Servers N servers: Hypercube Queueing Model Approximations Spatially Distributed Queues II M/G/1 2 Servers N servers: Hypercube Queueing Model Approximations Setup: Hypercube Queueing Model Region comprised of geographical atoms or nodes Each node j is an independent

More information

PBW 654 Applied Statistics - I Urban Operations Research

PBW 654 Applied Statistics - I Urban Operations Research PBW 654 Applied Statistics - I Urban Operations Research Lecture 2.I Queuing Systems An Introduction Operations Research Models Deterministic Models Linear Programming Integer Programming Network Optimization

More information

THE MAXIMAL EXPECTED COVERAGE RELOCATION PROBLEM FOR EMERGENCY VEHICLES. Michel Gendreau 1,2 Gilbert Laporte 2,3 Frédéric Semet 4,5.

THE MAXIMAL EXPECTED COVERAGE RELOCATION PROBLEM FOR EMERGENCY VEHICLES. Michel Gendreau 1,2 Gilbert Laporte 2,3 Frédéric Semet 4,5. THE MAXIMAL EXPECTED COVERAGE RELOCATION PROBLEM FOR EMERGENCY VEHICLES by Michel Gendreau 1,2 Gilbert Laporte 2,3 Frédéric Semet 4,5 July, 2003 1 Département d informatique et de recherche opérationnelle,

More information

Facility Location Models in Emergency Medical Service: Robustness and Approximations

Facility Location Models in Emergency Medical Service: Robustness and Approximations Delft University of Technology Faculty of Electrical Engineering, Mathematics and Computer Science Delft Institute of Applied Mathematics Facility Location Models in Emergency Medical Service: Robustness

More information

Session-Based Queueing Systems

Session-Based Queueing Systems Session-Based Queueing Systems Modelling, Simulation, and Approximation Jeroen Horters Supervisor VU: Sandjai Bhulai Executive Summary Companies often offer services that require multiple steps on the

More information

German data sets for comparing ambulance location models

German data sets for comparing ambulance location models German data sets for comparing ambulance location models Melanie Reuter-Oppermann a, Christiane Bernath a a Karlsruhe Service Research Institute (KSRI), Karlsruhe Institute of Technology, Germany Abstract

More information

λ 2 1 = 2 = 2 2 2P 1 =4P 2 P 0 + P 1 + P 2 =1 P 0 =, P 1 =, P 2 = ρ 1 = P 1 + P 2 =, ρ 2 = P 1 + P 2 =

λ 2 1 = 2 = 2 2 2P 1 =4P 2 P 0 + P 1 + P 2 =1 P 0 =, P 1 =, P 2 = ρ 1 = P 1 + P 2 =, ρ 2 = P 1 + P 2 = Urban Operations Research Compiled by James S. Kang Fall 001 Quiz Solutions 1//001 Problem 1 (Larson, 001) 1 (a) One is tempted to say yes by setting ρ = Nµ = =.But = is not the rate at which customers

More information

Queueing Systems: Lecture 3. Amedeo R. Odoni October 18, Announcements

Queueing Systems: Lecture 3. Amedeo R. Odoni October 18, Announcements Queueing Systems: Lecture 3 Amedeo R. Odoni October 18, 006 Announcements PS #3 due tomorrow by 3 PM Office hours Odoni: Wed, 10/18, :30-4:30; next week: Tue, 10/4 Quiz #1: October 5, open book, in class;

More information

A STAFFING ALGORITHM FOR CALL CENTERS WITH SKILL-BASED ROUTING: SUPPLEMENTARY MATERIAL

A STAFFING ALGORITHM FOR CALL CENTERS WITH SKILL-BASED ROUTING: SUPPLEMENTARY MATERIAL A STAFFING ALGORITHM FOR CALL CENTERS WITH SKILL-BASED ROUTING: SUPPLEMENTARY MATERIAL by Rodney B. Wallace IBM and The George Washington University rodney.wallace@us.ibm.com Ward Whitt Columbia University

More information

BIRTH DEATH PROCESSES AND QUEUEING SYSTEMS

BIRTH DEATH PROCESSES AND QUEUEING SYSTEMS BIRTH DEATH PROCESSES AND QUEUEING SYSTEMS Andrea Bobbio Anno Accademico 999-2000 Queueing Systems 2 Notation for Queueing Systems /λ mean time between arrivals S = /µ ρ = λ/µ N mean service time traffic

More information

λ λ λ In-class problems

λ λ λ In-class problems In-class problems 1. Customers arrive at a single-service facility at a Poisson rate of 40 per hour. When two or fewer customers are present, a single attendant operates the facility, and the service time

More information

Performance Evaluation of Queuing Systems

Performance Evaluation of Queuing Systems Performance Evaluation of Queuing Systems Introduction to Queuing Systems System Performance Measures & Little s Law Equilibrium Solution of Birth-Death Processes Analysis of Single-Station Queuing Systems

More information

1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours)

1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours) 1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours) Student Name: Alias: Instructions: 1. This exam is open-book 2. No cooperation is permitted 3. Please write down your name

More information

Queueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K "

Queueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems  M/M/1  M/M/m  M/M/1/K Queueing Theory I Summary Little s Law Queueing System Notation Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K " Little s Law a(t): the process that counts the number of arrivals

More information

The distances between atoms, for instance within sector 5, are as follows:

The distances between atoms, for instance within sector 5, are as follows: Urban Operations Research Compiled by James S. Kang Fall 00 Problem Set 5 Solutions //00. (Kang, 00) The distances between atoms, for instance within sector 5, are as follows: 5 0.5 0.5 0.5 0.5 0.5 0.5

More information

Network design for a service operation with lost demand and possible disruptions

Network design for a service operation with lost demand and possible disruptions Network design for a service operation with lost demand and possible disruptions Opher Baron, Oded Berman, Yael Deutsch Joseph L. Rotman School of Management, University of Toronto, 105 St. George St.,

More information

Basic Queueing Theory

Basic Queueing Theory After The Race The Boston Marathon is a local institution with over a century of history and tradition. The race is run on Patriot s Day, starting on the Hopkinton green and ending at the Prudential Center

More information

A Study on Performance Analysis of Queuing System with Multiple Heterogeneous Servers

A Study on Performance Analysis of Queuing System with Multiple Heterogeneous Servers UNIVERSITY OF OKLAHOMA GENERAL EXAM REPORT A Study on Performance Analysis of Queuing System with Multiple Heterogeneous Servers Prepared by HUSNU SANER NARMAN husnu@ou.edu based on the papers 1) F. S.

More information

THIELE CENTRE. The M/M/1 queue with inventory, lost sale and general lead times. Mohammad Saffari, Søren Asmussen and Rasoul Haji

THIELE CENTRE. The M/M/1 queue with inventory, lost sale and general lead times. Mohammad Saffari, Søren Asmussen and Rasoul Haji THIELE CENTRE for applied mathematics in natural science The M/M/1 queue with inventory, lost sale and general lead times Mohammad Saffari, Søren Asmussen and Rasoul Haji Research Report No. 11 September

More information

Appendix. A. Simulation study on the effect of aggregate data

Appendix. A. Simulation study on the effect of aggregate data 36 Article submitted to Operations Research; manuscript no. Appendix A. Simulation study on the effect of aggregate data One of the main limitations of our data are that they are aggregate at the annual

More information

Waiting Time Analysis of A Single Server Queue in an Out- Patient Clinic

Waiting Time Analysis of A Single Server Queue in an Out- Patient Clinic IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 11, Issue 3 Ver. V (May - Jun. 2015), PP 54-58 www.iosrjournals.org Waiting Time Analysis of A Single Server Queue in

More information

Using GIS to Evaluate Rural Emergency Medical Services (EMS)

Using GIS to Evaluate Rural Emergency Medical Services (EMS) Using GIS to Evaluate Rural Emergency Medical Services (EMS) Zhaoxiang He Graduate Research Assistant Xiao Qin Ph.D., P.E. Associate Professor Outline Introduction Literature Review Study Design Data Collection

More information

Queueing systems. Renato Lo Cigno. Simulation and Performance Evaluation Queueing systems - Renato Lo Cigno 1

Queueing systems. Renato Lo Cigno. Simulation and Performance Evaluation Queueing systems - Renato Lo Cigno 1 Queueing systems Renato Lo Cigno Simulation and Performance Evaluation 2014-15 Queueing systems - Renato Lo Cigno 1 Queues A Birth-Death process is well modeled by a queue Indeed queues can be used to

More information

6 Solving Queueing Models

6 Solving Queueing Models 6 Solving Queueing Models 6.1 Introduction In this note we look at the solution of systems of queues, starting with simple isolated queues. The benefits of using predefined, easily classified queues will

More information

Efficient Solution of a Class of Location-Allocation Problems with Stochastic Demand and Congestion

Efficient Solution of a Class of Location-Allocation Problems with Stochastic Demand and Congestion Efficient Solution of a Class of Location-Allocation Problems with Stochastic Demand and Congestion Navneet Vidyarthi a,, Sachin Jayaswal b a Department of Supply Chain and Business Technology Management,

More information

A Bound on the Performance of an Optimal Ambulance Redeployment Policy

A Bound on the Performance of an Optimal Ambulance Redeployment Policy Submitted to Operations Research manuscript OPRE-21-7-.R1 A Bound on the Performance of an Optimal Ambulance Redeployment Policy Matthew S. Maxwell, Eric Cao Ni, Chaoxu Tong, Shane G. Henderson Susan R.

More information

transportation research in policy making for addressing mobility problems, infrastructure and functionality issues in urban areas. This study explored

transportation research in policy making for addressing mobility problems, infrastructure and functionality issues in urban areas. This study explored ABSTRACT: Demand supply system are the three core clusters of transportation research in policy making for addressing mobility problems, infrastructure and functionality issues in urban areas. This study

More information

Dynamic Control of a Tandem Queueing System with Abandonments

Dynamic Control of a Tandem Queueing System with Abandonments Dynamic Control of a Tandem Queueing System with Abandonments Gabriel Zayas-Cabán 1 Jungui Xie 2 Linda V. Green 3 Mark E. Lewis 1 1 Cornell University Ithaca, NY 2 University of Science and Technology

More information

Queuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem. Wade Trappe

Queuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem. Wade Trappe Queuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem Wade Trappe Lecture Overview Network of Queues Introduction Queues in Tandem roduct Form Solutions Burke s Theorem What

More information

CPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017

CPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017 CPSC 531: System Modeling and Simulation Carey Williamson Department of Computer Science University of Calgary Fall 2017 Motivating Quote for Queueing Models Good things come to those who wait - poet/writer

More information

On the Partitioning of Servers in Queueing Systems during Rush Hour

On the Partitioning of Servers in Queueing Systems during Rush Hour On the Partitioning of Servers in Queueing Systems during Rush Hour Bin Hu Saif Benjaafar Department of Operations and Management Science, Ross School of Business, University of Michigan at Ann Arbor,

More information

Ensuring feasibility in location problems with stochastic demands and congestion

Ensuring feasibility in location problems with stochastic demands and congestion IIE Transactions (2009) 41, 467 481 Copyright C IIE ISSN: 0740-817X print / 1545-8830 online DOI: 10.1080/07408170802382758 Ensuring feasibility in location problems with stochastic demands and congestion

More information

Advanced Computer Networks Lecture 3. Models of Queuing

Advanced Computer Networks Lecture 3. Models of Queuing Advanced Computer Networks Lecture 3. Models of Queuing Husheng Li Min Kao Department of Electrical Engineering and Computer Science University of Tennessee, Knoxville Spring, 2016 1/13 Terminology of

More information

Location and Allocation of Service Units on a Congested Network with Time Varying Demand Rates

Location and Allocation of Service Units on a Congested Network with Time Varying Demand Rates Location and Allocation of Service Units on a Congested Network with Time Varying Demand Rates Navneet Vidyarthi a,, Arjun Bhardwaj b, Niraj Sinha c a Department of Supply Chain and Technology Management,

More information

Page 0 of 5 Final Examination Name. Closed book. 120 minutes. Cover page plus five pages of exam.

Page 0 of 5 Final Examination Name. Closed book. 120 minutes. Cover page plus five pages of exam. Final Examination Closed book. 120 minutes. Cover page plus five pages of exam. To receive full credit, show enough work to indicate your logic. Do not spend time calculating. You will receive full credit

More information

arxiv: v1 [stat.ap] 21 Feb 2016

arxiv: v1 [stat.ap] 21 Feb 2016 Analytic queueing model for ambulance services Pedro A. Pury Facultad de Matemática, Astronomía, Física y Computación Universidad Nacional de Córdoba Ciudad Universitaria, X5000HUA Córdoba, Argentina pury@famaf.unc.edu.ar

More information

NANYANG TECHNOLOGICAL UNIVERSITY SEMESTER I EXAMINATION MH4702/MAS446/MTH437 Probabilistic Methods in OR

NANYANG TECHNOLOGICAL UNIVERSITY SEMESTER I EXAMINATION MH4702/MAS446/MTH437 Probabilistic Methods in OR NANYANG TECHNOLOGICAL UNIVERSITY SEMESTER I EXAMINATION 2013-201 MH702/MAS6/MTH37 Probabilistic Methods in OR December 2013 TIME ALLOWED: 2 HOURS INSTRUCTIONS TO CANDIDATES 1. This examination paper contains

More information

Data analysis and stochastic modeling

Data analysis and stochastic modeling Data analysis and stochastic modeling Lecture 7 An introduction to queueing theory Guillaume Gravier guillaume.gravier@irisa.fr with a lot of help from Paul Jensen s course http://www.me.utexas.edu/ jensen/ormm/instruction/powerpoint/or_models_09/14_queuing.ppt

More information

Fundamental Characteristics of Urban Transportation Services

Fundamental Characteristics of Urban Transportation Services Fundamental Characteristics of Urban Transportation Services Anton J. Kleywegt School of Industrial and Systems Engineering Georgia Institute of Technology Smart Urban Transportation Forum Institute for

More information

Stability of the two queue system

Stability of the two queue system Stability of the two queue system Iain M. MacPhee and Lisa J. Müller University of Durham Department of Mathematical Science Durham, DH1 3LE, UK (e-mail: i.m.macphee@durham.ac.uk, l.j.muller@durham.ac.uk)

More information

5/15/18. Operations Research: An Introduction Hamdy A. Taha. Copyright 2011, 2007 by Pearson Education, Inc. All rights reserved.

5/15/18. Operations Research: An Introduction Hamdy A. Taha. Copyright 2011, 2007 by Pearson Education, Inc. All rights reserved. The objective of queuing analysis is to offer a reasonably satisfactory service to waiting customers. Unlike the other tools of OR, queuing theory is not an optimization technique. Rather, it determines

More information

Queuing Theory. 3. Birth-Death Process. Law of Motion Flow balance equations Steady-state probabilities: , if

Queuing Theory. 3. Birth-Death Process. Law of Motion Flow balance equations Steady-state probabilities: , if 1 Queuing Theory 3. Birth-Death Process Law of Motion Flow balance equations Steady-state probabilities: c j = λ 0λ 1...λ j 1 µ 1 µ 2...µ j π 0 = 1 1+ j=1 c j, if j=1 c j is finite. π j = c j π 0 Example

More information

Course Outline Introduction to Transportation Highway Users and their Performance Geometric Design Pavement Design

Course Outline Introduction to Transportation Highway Users and their Performance Geometric Design Pavement Design Course Outline Introduction to Transportation Highway Users and their Performance Geometric Design Pavement Design Speed Studies - Project Traffic Queuing Intersections Level of Service in Highways and

More information

The Vehicle Mix Decision in Emergency Medical Service Systems

The Vehicle Mix Decision in Emergency Medical Service Systems Submitted to Manufacturing & Service Operations Management manuscript (Please, provide the manuscript number!) Authors are encouraged to submit new papers to INFORMS journals by means of a style file template,

More information

Computer Systems Modelling

Computer Systems Modelling Computer Systems Modelling Computer Laboratory Computer Science Tripos, Part II Michaelmas Term 2003 R. J. Gibbens Problem sheet William Gates Building JJ Thomson Avenue Cambridge CB3 0FD http://www.cl.cam.ac.uk/

More information

Introduction to queuing theory

Introduction to queuing theory Introduction to queuing theory Claude Rigault ENST claude.rigault@enst.fr Introduction to Queuing theory 1 Outline The problem The number of clients in a system The client process Delay processes Loss

More information

Continuous Time Processes

Continuous Time Processes page 102 Chapter 7 Continuous Time Processes 7.1 Introduction In a continuous time stochastic process (with discrete state space), a change of state can occur at any time instant. The associated point

More information

Lecture 7: Simulation of Markov Processes. Pasi Lassila Department of Communications and Networking

Lecture 7: Simulation of Markov Processes. Pasi Lassila Department of Communications and Networking Lecture 7: Simulation of Markov Processes Pasi Lassila Department of Communications and Networking Contents Markov processes theory recap Elementary queuing models for data networks Simulation of Markov

More information

On the Partitioning of Servers in Queueing Systems during Rush Hour

On the Partitioning of Servers in Queueing Systems during Rush Hour On the Partitioning of Servers in Queueing Systems during Rush Hour This paper is motivated by two phenomena observed in many queueing systems in practice. The first is the partitioning of server capacity

More information

Name of the Student:

Name of the Student: SUBJECT NAME : Probability & Queueing Theory SUBJECT CODE : MA 6453 MATERIAL NAME : Part A questions REGULATION : R2013 UPDATED ON : November 2017 (Upto N/D 2017 QP) (Scan the above QR code for the direct

More information

Strategic Properties of Heterogeneous Serial Cost Sharing

Strategic Properties of Heterogeneous Serial Cost Sharing Strategic Properties of Heterogeneous Serial Cost Sharing Eric J. Friedman Department of Economics, Rutgers University New Brunswick, NJ 08903. January 27, 2000 Abstract We show that serial cost sharing

More information

Changes in the Spatial Distribution of Mobile Source Emissions due to the Interactions between Land-use and Regional Transportation Systems

Changes in the Spatial Distribution of Mobile Source Emissions due to the Interactions between Land-use and Regional Transportation Systems Changes in the Spatial Distribution of Mobile Source Emissions due to the Interactions between Land-use and Regional Transportation Systems A Framework for Analysis Urban Transportation Center University

More information

The effect of probabilities of departure with time in a bank

The effect of probabilities of departure with time in a bank International Journal of Scientific & Engineering Research, Volume 3, Issue 7, July-2012 The effect of probabilities of departure with time in a bank Kasturi Nirmala, Shahnaz Bathul Abstract This paper

More information

Multiserver Queueing Model subject to Single Exponential Vacation

Multiserver Queueing Model subject to Single Exponential Vacation Journal of Physics: Conference Series PAPER OPEN ACCESS Multiserver Queueing Model subject to Single Exponential Vacation To cite this article: K V Vijayashree B Janani 2018 J. Phys.: Conf. Ser. 1000 012129

More information

Quality of Real-Time Streaming in Wireless Cellular Networks : Stochastic Modeling and Analysis

Quality of Real-Time Streaming in Wireless Cellular Networks : Stochastic Modeling and Analysis Quality of Real-Time Streaming in Wireless Cellular Networs : Stochastic Modeling and Analysis B. Blaszczyszyn, M. Jovanovic and M. K. Karray Based on paper [1] WiOpt/WiVid Mai 16th, 2014 Outline Introduction

More information

I, A BRIEF REVIEW ON INFINITE QUEUE MODEL M.

I, A BRIEF REVIEW ON INFINITE QUEUE MODEL M. A BRIEF REVIEW ON INFINITE QUEUE MODEL M. Vasuki*, A. Dinesh Kumar** & G. Vijayaprabha** * Assistant Professor, Department of Mathematics, Srinivasan College of Arts and Science, Perambalur, Tamilnadu

More information

Massachusetts Institute of Technology

Massachusetts Institute of Technology .203J/6.28J/3.665J/5.073J/6.76J/ESD.26J Quiz Solutions (a)(i) Without loss of generality we can pin down X at any fixed point. X 2 is still uniformly distributed over the square. Assuming that the police

More information

Network Analysis of Fuzzy Bi-serial and Parallel Servers with a Multistage Flow Shop Model

Network Analysis of Fuzzy Bi-serial and Parallel Servers with a Multistage Flow Shop Model 2st International Congress on Modelling and Simulation, Gold Coast, Australia, 29 Nov to 4 Dec 205 wwwmssanzorgau/modsim205 Network Analysis of Fuzzy Bi-serial and Parallel Servers with a Multistage Flow

More information

Travel Time Calculation With GIS in Rail Station Location Optimization

Travel Time Calculation With GIS in Rail Station Location Optimization Travel Time Calculation With GIS in Rail Station Location Optimization Topic Scope: Transit II: Bus and Rail Stop Information and Analysis Paper: # UC8 by Sutapa Samanta Doctoral Student Department of

More information

Multi Heterogeneous Queueing Server System. General Exam Oral Examination Fall 2012 prepared by Husnu Saner Narman

Multi Heterogeneous Queueing Server System. General Exam Oral Examination Fall 2012 prepared by Husnu Saner Narman Multi Heterogeneous Queueing Server System General Exam Oral Examination Fall 2012 prepared by Husnu Saner Narman Content Motivation Contribution Multi Heterogeneous System First Model Analysis of First

More information

LOCATION OF PREHOSPITAL CARE BASIS THROUGH COMBINED FUZZY AHP AND GIS METHOD

LOCATION OF PREHOSPITAL CARE BASIS THROUGH COMBINED FUZZY AHP AND GIS METHOD ISAHP Article: Mu, Saaty/A Style Guide for Paper Proposals To Be Submitted to the LOCATION OF PREHOSPITAL CARE BASIS THROUGH COMBINED FUZZY AHP AND GIS METHOD Marco Tiznado Departamento de Ingeniería Industrial,

More information

Methodology for Computer Science Research Lecture 4: Mathematical Modeling

Methodology for Computer Science Research Lecture 4: Mathematical Modeling Methodology for Computer Science Research Andrey Lukyanenko Department of Computer Science and Engineering Aalto University, School of Science and Technology andrey.lukyanenko@tkk.fi Definitions and Goals

More information

Typical information required from the data collection can be grouped into four categories, enumerated as below.

Typical information required from the data collection can be grouped into four categories, enumerated as below. Chapter 6 Data Collection 6.1 Overview The four-stage modeling, an important tool for forecasting future demand and performance of a transportation system, was developed for evaluating large-scale infrastructure

More information

Dynamic Control of Parallel-Server Systems

Dynamic Control of Parallel-Server Systems Dynamic Control of Parallel-Server Systems Jim Dai Georgia Institute of Technology Tolga Tezcan University of Illinois at Urbana-Champaign May 13, 2009 Jim Dai (Georgia Tech) Many-Server Asymptotic Optimality

More information

Logistical and Transportation Planning Methods 1.203J/6.281J/13.665J/15.073J/16.76J/ESD.216J

Logistical and Transportation Planning Methods 1.203J/6.281J/13.665J/15.073J/16.76J/ESD.216J Logistical and Transportation Planning Methods 1.203J/6.281J/13.665J/15.073J/16.76J/ESD.216J Massachusetts Institute of Technology Cambridge, Massachusetts Quiz #1 October 26, 2005 OPEN BOOK TWO HOURS

More information

Queues and Queueing Networks

Queues and Queueing Networks Queues and Queueing Networks Sanjay K. Bose Dept. of EEE, IITG Copyright 2015, Sanjay K. Bose 1 Introduction to Queueing Models and Queueing Analysis Copyright 2015, Sanjay K. Bose 2 Model of a Queue Arrivals

More information

Performance analysis of queueing systems with resequencing

Performance analysis of queueing systems with resequencing UNIVERSITÀ DEGLI STUDI DI SALERNO Dipartimento di Matematica Dottorato di Ricerca in Matematica XIV ciclo - Nuova serie Performance analysis of queueing systems with resequencing Candidato: Caraccio Ilaria

More information

Non Markovian Queues (contd.)

Non Markovian Queues (contd.) MODULE 7: RENEWAL PROCESSES 29 Lecture 5 Non Markovian Queues (contd) For the case where the service time is constant, V ar(b) = 0, then the P-K formula for M/D/ queue reduces to L s = ρ + ρ 2 2( ρ) where

More information

TRAVEL TIME RELIABILITY ON EXPRESSWAY NETWORK UNDER UNCERTAIN ENVIRONMENT OF SNOWFALL AND TRAFFIC REGULATION

TRAVEL TIME RELIABILITY ON EXPRESSWAY NETWORK UNDER UNCERTAIN ENVIRONMENT OF SNOWFALL AND TRAFFIC REGULATION TRAVEL TIME RELIABILITY ON EXPRESSWAY NETWORK UNDER UNCERTAIN ENVIRONMENT OF SNOWFALL AND TRAFFIC REGULATION Hiroshi Wakabayashi Faculty of Urban Science, Meijo University, 4-3-3, Nijigaoka, Kani-City,

More information

Engineering Mathematics : Probability & Queueing Theory SUBJECT CODE : MA 2262 X find the minimum value of c.

Engineering Mathematics : Probability & Queueing Theory SUBJECT CODE : MA 2262 X find the minimum value of c. SUBJECT NAME : Probability & Queueing Theory SUBJECT CODE : MA 2262 MATERIAL NAME : University Questions MATERIAL CODE : SKMA104 UPDATED ON : May June 2013 Name of the Student: Branch: Unit I (Random Variables)

More information

Link Models for Circuit Switching

Link Models for Circuit Switching Link Models for Circuit Switching The basis of traffic engineering for telecommunication networks is the Erlang loss function. It basically allows us to determine the amount of telephone traffic that can

More information

Queuing Analysis. Chapter Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall

Queuing Analysis. Chapter Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall Queuing Analysis Chapter 13 13-1 Chapter Topics Elements of Waiting Line Analysis The Single-Server Waiting Line System Undefined and Constant Service Times Finite Queue Length Finite Calling Problem The

More information

Data Collection. Lecture Notes in Transportation Systems Engineering. Prof. Tom V. Mathew. 1 Overview 1

Data Collection. Lecture Notes in Transportation Systems Engineering. Prof. Tom V. Mathew. 1 Overview 1 Data Collection Lecture Notes in Transportation Systems Engineering Prof. Tom V. Mathew Contents 1 Overview 1 2 Survey design 2 2.1 Information needed................................. 2 2.2 Study area.....................................

More information

ANALYTICAL MODELS TO EVALUATE SYSTEM PERFORMANCE MEASURES FOR VEHICLE BASED MATERIAL-HANDLING SYSTEMS UNDER VARIOUS DISPATCHING POLICIES

ANALYTICAL MODELS TO EVALUATE SYSTEM PERFORMANCE MEASURES FOR VEHICLE BASED MATERIAL-HANDLING SYSTEMS UNDER VARIOUS DISPATCHING POLICIES i. ANALYICAL MODELS O EVALUAE SYSEM PERFORMANCE MEASURES FOR VEHICLE BASED MAERIAL-HANDLING SYSEMS UNDER VARIOUS DISPACHING POLICIES A Dissertation by MOONSU LEE Submitted to the Office of Graduate Studies

More information

An M/M/1 Queue in Random Environment with Disasters

An M/M/1 Queue in Random Environment with Disasters An M/M/1 Queue in Random Environment with Disasters Noam Paz 1 and Uri Yechiali 1,2 1 Department of Statistics and Operations Research School of Mathematical Sciences Tel Aviv University, Tel Aviv 69978,

More information

UNIVERSITY OF YORK. MSc Examinations 2004 MATHEMATICS Networks. Time Allowed: 3 hours.

UNIVERSITY OF YORK. MSc Examinations 2004 MATHEMATICS Networks. Time Allowed: 3 hours. UNIVERSITY OF YORK MSc Examinations 2004 MATHEMATICS Networks Time Allowed: 3 hours. Answer 4 questions. Standard calculators will be provided but should be unnecessary. 1 Turn over 2 continued on next

More information

Quiz Queue II. III. ( ) ( ) =1.3333

Quiz Queue II. III. ( ) ( ) =1.3333 Quiz Queue UMJ, a mail-order company, receives calls to place orders at an average of 7.5 minutes intervals. UMJ hires one operator and can handle each call in about every 5 minutes on average. The inter-arrival

More information

Queuing Theory. The present section focuses on the standard vocabulary of Waiting Line Models.

Queuing Theory. The present section focuses on the standard vocabulary of Waiting Line Models. Queuing Theory Introduction Waiting lines are the most frequently encountered problems in everyday life. For example, queue at a cafeteria, library, bank, etc. Common to all of these cases are the arrivals

More information

Proceedings of the 2012 Winter Simulation Conference C. Laroque, J. Himmelspach, R. Pasupathy, O. Rose, and A. M. Uhrmacher, eds.

Proceedings of the 2012 Winter Simulation Conference C. Laroque, J. Himmelspach, R. Pasupathy, O. Rose, and A. M. Uhrmacher, eds. Proceedings of the 2 Winter Simulation Conference C. Laroque, J. Himmelspach, R. Pasupathy, O. Rose, and A. M. Uhrmacher, eds. EXPLORING BOUNDS ON AMBULANCE DEPLOYMENT POLICY PERFORMANCE Eric Cao Ni Susan

More information

GIS ANALYSIS METHODOLOGY

GIS ANALYSIS METHODOLOGY GIS ANALYSIS METHODOLOGY No longer the exclusive domain of cartographers, computer-assisted drawing technicians, mainframes, and workstations, geographic information system (GIS) mapping has migrated to

More information

Optimizing Urban Modeling based on Road Network and Land Use/Cover Changes by Using Agent Base Cellular Automata Model

Optimizing Urban Modeling based on Road Network and Land Use/Cover Changes by Using Agent Base Cellular Automata Model Optimizing Urban Modeling based on Road Network and Land Use/Cover Changes by Using Agent Base Cellular Automata Model Yousef Khajavigodellou 1, A. A. Alesheikh 2, Farshad Hakimpour 3, Kamra Chapi 4 1

More information

Verification and Validation. CS1538: Introduction to Simulations

Verification and Validation. CS1538: Introduction to Simulations Verification and Validation CS1538: Introduction to Simulations Steps in a Simulation Study Problem & Objective Formulation Model Conceptualization Data Collection Model translation, Verification, Validation

More information

Load Balancing in Distributed Service System: A Survey

Load Balancing in Distributed Service System: A Survey Load Balancing in Distributed Service System: A Survey Xingyu Zhou The Ohio State University zhou.2055@osu.edu November 21, 2016 Xingyu Zhou (OSU) Load Balancing November 21, 2016 1 / 29 Introduction and

More information

The discrete-time Geom/G/1 queue with multiple adaptive vacations and. setup/closedown times

The discrete-time Geom/G/1 queue with multiple adaptive vacations and. setup/closedown times ISSN 1750-9653, England, UK International Journal of Management Science and Engineering Management Vol. 2 (2007) No. 4, pp. 289-296 The discrete-time Geom/G/1 queue with multiple adaptive vacations and

More information

Spatiotemporal Analysis of Urban Traffic Accidents: A Case Study of Tehran City, Iran

Spatiotemporal Analysis of Urban Traffic Accidents: A Case Study of Tehran City, Iran Spatiotemporal Analysis of Urban Traffic Accidents: A Case Study of Tehran City, Iran January 2018 Niloofar HAJI MIRZA AGHASI Spatiotemporal Analysis of Urban Traffic Accidents: A Case Study of Tehran

More information

CHAPTER 3. CAPACITY OF SIGNALIZED INTERSECTIONS

CHAPTER 3. CAPACITY OF SIGNALIZED INTERSECTIONS CHAPTER 3. CAPACITY OF SIGNALIZED INTERSECTIONS 1. Overview In this chapter we explore the models on which the HCM capacity analysis method for signalized intersections are based. While the method has

More information

EQUILIBRIUM STRATEGIES IN AN M/M/1 QUEUE WITH SETUP TIMES AND A SINGLE VACATION POLICY

EQUILIBRIUM STRATEGIES IN AN M/M/1 QUEUE WITH SETUP TIMES AND A SINGLE VACATION POLICY EQUILIBRIUM STRATEGIES IN AN M/M/1 QUEUE WITH SETUP TIMES AND A SINGLE VACATION POLICY Dequan Yue 1, Ruiling Tian 1, Wuyi Yue 2, Yaling Qin 3 1 College of Sciences, Yanshan University, Qinhuangdao 066004,

More information

Queueing Theory and Simulation. Introduction

Queueing Theory and Simulation. Introduction Queueing Theory and Simulation Based on the slides of Dr. Dharma P. Agrawal, University of Cincinnati and Dr. Hiroyuki Ohsaki Graduate School of Information Science & Technology, Osaka University, Japan

More information

MULTIPLE CHOICE QUESTIONS DECISION SCIENCE

MULTIPLE CHOICE QUESTIONS DECISION SCIENCE MULTIPLE CHOICE QUESTIONS DECISION SCIENCE 1. Decision Science approach is a. Multi-disciplinary b. Scientific c. Intuitive 2. For analyzing a problem, decision-makers should study a. Its qualitative aspects

More information

57:022 Principles of Design II Final Exam Solutions - Spring 1997

57:022 Principles of Design II Final Exam Solutions - Spring 1997 57:022 Principles of Design II Final Exam Solutions - Spring 1997 Part: I II III IV V VI Total Possible Pts: 52 10 12 16 13 12 115 PART ONE Indicate "+" if True and "o" if False: + a. If a component's

More information

HITTING TIME IN AN ERLANG LOSS SYSTEM

HITTING TIME IN AN ERLANG LOSS SYSTEM Probability in the Engineering and Informational Sciences, 16, 2002, 167 184+ Printed in the U+S+A+ HITTING TIME IN AN ERLANG LOSS SYSTEM SHELDON M. ROSS Department of Industrial Engineering and Operations

More information

CE351 Transportation Systems: Planning and Design

CE351 Transportation Systems: Planning and Design CE351 Transportation Systems: Planning and Design TOPIC: Level of Service (LOS) at Traffic Signals 1 Course Outline Introduction to Transportation Highway Users and their Performance Geometric Design Pavement

More information

Slides 9: Queuing Models

Slides 9: Queuing Models Slides 9: Queuing Models Purpose Simulation is often used in the analysis of queuing models. A simple but typical queuing model is: Queuing models provide the analyst with a powerful tool for designing

More information

Bounded Delay for Weighted Round Robin with Burst Crediting

Bounded Delay for Weighted Round Robin with Burst Crediting Bounded Delay for Weighted Round Robin with Burst Crediting Sponsor: Sprint Kert Mezger David W. Petr Technical Report TISL-0230-08 Telecommunications and Information Sciences Laboratory Department of

More information

Scheduling I. Today Introduction to scheduling Classical algorithms. Next Time Advanced topics on scheduling

Scheduling I. Today Introduction to scheduling Classical algorithms. Next Time Advanced topics on scheduling Scheduling I Today Introduction to scheduling Classical algorithms Next Time Advanced topics on scheduling Scheduling out there You are the manager of a supermarket (ok, things don t always turn out the

More information

Chapter 1. Introduction. 1.1 Stochastic process

Chapter 1. Introduction. 1.1 Stochastic process Chapter 1 Introduction Process is a phenomenon that takes place in time. In many practical situations, the result of a process at any time may not be certain. Such a process is called a stochastic process.

More information

Robustness and performance of threshold-based resource allocation policies

Robustness and performance of threshold-based resource allocation policies Robustness and performance of threshold-based resource allocation policies Takayuki Osogami Mor Harchol-Balter Alan Scheller-Wolf Computer Science Department, Carnegie Mellon University, 5000 Forbes Avenue,

More information