An Efficient Exact Hypercube Model with Fully Dedicated Servers

Published Online:https://doi.org/10.1287/trsc.2020.1007

References

  • Alanis R, Ingolfsson A, Kolfal B (2013) A Markov chain model for an EMS system with repositioning. Production Oper. Management 22(1):216–231.CrossrefGoogle Scholar
  • An Y, Zeng B, Zhang Y, Zhao L (2014) Reliable p-median facility location problem: Two-stage robust models and algorithms. Transportation Res. Part B: Methodological 64(June):54–72.CrossrefGoogle Scholar
  • Ansari S, McLay LA, Mayorga ME (2017) A maximum expected covering problem for district design. Transportation Sci. 51(1):376–390.LinkGoogle Scholar
  • Atkinson JB, Kovalenko IN, Kuznetsov NY, Mikhalevich KV (2006) Heuristic methods for the analysis of a queueing system describing emergency medical service deployed along a highway. Cybernetics Systems Anal. 42(3):379–391.CrossrefGoogle Scholar
  • Atkinson JB, Kovalenko IN, Kuznetsov NY, Mikhalevich KV (2008) A hypercube queueing loss model with customer-dependent service rates. Eur. J. Oper. Res. 191(1):223–239.CrossrefGoogle Scholar
  • Batta R (1989) Technical note—The stochastic queue median over a finite discrete set. Oper. Res. 37(4):648–652.LinkGoogle Scholar
  • Batta R, Dolan J, Krishnamurthy N (1989) The maximal expected covering location problem: Revisited. Transportation Sci. 23(4):277–287.LinkGoogle Scholar
  • Beojone CV, Souza RM (2017) Application of the hypercube model with queue priorities and more than one preferential server: A case study on a SAMU. Gestão Produção 24(4):814–828.CrossrefGoogle Scholar
  • Berman O, Larson RC (1982) The median problem with congestion. Comput. Oper. Res. 9(2):119–126.CrossrefGoogle Scholar
  • Berman O, Odoni AR (1982) Locating mobile servers on a network with Markovian properties. Networks 12(1):73–86.CrossrefGoogle Scholar
  • Berman O, Larson RC, Chiu SS (1985) Optimal server location on a network operating as an M/G/1 queue. Oper. Res. 33(4):746–771.LinkGoogle Scholar
  • Berman O, Larson RC, Parkan C (1987) The stochastic queue p-median problem. Transportation Sci. 21(3):207–216.LinkGoogle Scholar
  • Boyaci B, Geroliminis N (2011) Extended hypercube models for large scale spatial queueing systems. 11th Swiss Transport Res. Conf. (Ascona, Switzerland).Google Scholar
  • Boyaci B, Geroliminis N (2012) Extended hypercube models for large scale spatial queueing systems. Transportation Res. Board 91th Annual Meeting (Transportation Research Board, Washington, DC).Google Scholar
  • Boyaci B, Geroliminis N (2015) Approximation methods for large-scale spatial queueing systems. Transportation Res. Part B: Methodological 74(April):151–181.CrossrefGoogle Scholar
  • Brotcorne L, Laporte G, Semet F (2003) Ambulance location and relocation models. Eur. J. Oper. Res. 147(3):451–463.CrossrefGoogle Scholar
  • Budge S, Ingolfsson A, Erkut E (2009) Technical note—Approximating vehicle dispatch probabilities for emergency service systems with location-specific service times and multiple units per location. Oper. Res. 57(1):251–255.LinkGoogle Scholar
  • Burwell T, Jarvis J, McKnew M (1993) Modeling co-located servers and dispatch ties in the hypercube model. Comput. Oper. Res. 20(2):113–119.CrossrefGoogle Scholar
  • Chelst K, Barlach Z (1981) Multiple unit dispatches in emergency services: Models to estimate system performance. Management Sci. 27(12):1390–1409.LinkGoogle Scholar
  • Chiyoshi F, Iannoni A, Morabito R (2011) A tutorial on hypercube queueing models and some practical applications in emergency service systems. Pesquisa Operacional 31(2):271–299.CrossrefGoogle Scholar
  • Chiyoshi FY, Galvão RD, Morabito R (2002) A note on solutions to the maximal expected covering location problem. Comput. Oper. Res. 30(1):87–96.CrossrefGoogle Scholar
  • Cui T, Ouyang Y, Shen ZJM (2010) Reliable facility location design under the risk of disruptions. Oper. Res. 58(4):998–1011.LinkGoogle Scholar
  • Daskin MS (1983) A maximum expected covering location model: Formulation, properties and heuristic solution. Transportation Sci. 17(1):48–70.LinkGoogle Scholar
  • Erkut E, Ingolfsson A, Erdogan G (2007) Ambulance location for maximum survival. Naval Res. Logist. 55(1):42–58.CrossrefGoogle Scholar
  • Galvão RD, Morabito R (2008) Emergency service systems: The use of the hypercube queueing model in the solution of probabilistic location problems. Internat. Trans. Oper. Res. 15(5):525–549.CrossrefGoogle Scholar
  • Gendreau M, Laporte G, Semet F (1997) Solving an ambulance location model by tabu search. Location Sci. 5(2):75–88.CrossrefGoogle Scholar
  • Geroliminis N, Kepaptsoglou K, Karlaftis MG (2011) A hybrid hypercube—Genetic algorithm approach for deploying many emergency mobile units in an urban network. Eur. J. Oper. Res. 210(2):287–300.CrossrefGoogle Scholar
  • Goldberg J, Dietrich R, Chen JM, Mitwasi G, Valenzuela T, Criss E (1990) Validating and applying a model for locating emergency medical vehicles in Tucson, AZ. Eur. J. Oper. Res. 49(3):308–324.CrossrefGoogle Scholar
  • Iannoni AP, Morabito R (2007) A multiple dispatch and partial backup hypercube queueing model to analyze emergency medical systems on highways. Transportation Res. Part E: Logist. Transportation Rev. 43(6):755–771.CrossrefGoogle Scholar
  • Iannoni AP, Chiyoshi F, Morabito R (2015) A spatially distributed queuing model considering dispatching policies with server reservation. Transportation Res. Part E: Logist. Transportation Rev. 75(March):46–66.CrossrefGoogle Scholar
  • Iannoni AP, Morabito R, Saydam C (2008) A hypercube queueing model embedded into a genetic algorithm for ambulance deployment on highways. Ann. Oper. Res. 157(1):207–224.Google Scholar
  • Iannoni A, Morabito R, Saydam C (2009) An optimization approach for ambulance location and the districting of the response segments on highways. Eur. J. Oper. Res. 195(2):528–542.CrossrefGoogle Scholar
  • Jarvis J (1985) Approximating the equilibrium behavior of multi-server loss systems. Management Sci. 31(2):235–239.LinkGoogle Scholar
  • Kleinrock L (1975) Queueing Systems, Volume I: Theory (John Willey & Sons, New York).Google Scholar
  • Knight VA, Harper PR, Smith L (2012) Ambulance allocation for maximal survival with heterogeneous outcome measures. Omega 40(6):918–926.CrossrefGoogle Scholar
  • Larson R (1974) A hypercube queuing model for facility and redistricting in urban emergency services. Comput. Oper. Res. 1(1):67–95.CrossrefGoogle Scholar
  • Larson R (1975) Approximating the performance of urban emergency service systems. Oper. Res. 23(5):845–868.LinkGoogle Scholar
  • Larson R, Odoni A (1981) Urban Operations Research, 1st ed. (Prentice Hall, Upper Saddle River, NJ).Google Scholar
  • Leknes H, Aartun ES, Andersson H, Christiansen M, Granberg TA (2017) Strategic ambulance location for heterogeneous regions. Eur. J. Oper. Res. 260(1):122–133.CrossrefGoogle Scholar
  • Li X, Ouyang Y (2010) A continuum approximation approach to reliable facility location design under correlated probabilistic disruptions. Transportation Res. Part B: Methodological 44(4):535–548.CrossrefGoogle Scholar
  • Mendonça F, Morabito R (2001) Analysing emergency medical service ambulance deployment on a Brazilian using the hypercube queueing model. J. Oper. Res. Soc. 52(3):261–270.CrossrefGoogle Scholar
  • Morabito R, Chiyoshi F, Galvão R (2008) Non-homogeneous servers in emergency medical systems: Practical applications using the hypercube queueing model. Socio-Econom. Planning Sci. 42(4):255–270.CrossrefGoogle Scholar
  • Owen SH, Daskin MS (1998) Strategic facility location: A review. Eur. J. Oper. Res. 111(3):423–447.CrossrefGoogle Scholar
  • Repede JF, Bernardo JJ (1994) Developing and validating a decision support system for locating emergency medical vehicles in Louisville, Kentucky. Eur. J. Oper. Res. 75(3):567–581.CrossrefGoogle Scholar
  • ReVelle C, Hogan K (1989) The maximum availability location problem. Transportation Sci. 23(3):192–200.LinkGoogle Scholar
  • Rodrigues LF, Morabito R, Chiyoshi FY, Iannoni AP, Saydam C (2017) Toward hypercube queueing models for dispatch policies with priority in queue and partial backup. Comput. Oper. Res. 84(August):92–105.CrossrefGoogle Scholar
  • Saydam C, Repede J, Burwell T (1994) Accurate estimation of expected coverage: A comparative study. Socio-Econom. Planning Sci. 28(2):113–120.CrossrefGoogle Scholar
  • Schmid V (2012) Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming. Eur. J. Oper. Res. 219:611–621.CrossrefGoogle Scholar
  • Schmid V, Doerner KF (2010) Ambulance location and relocation problems with time-dependent travel times. Eur. J. Oper. Res. 207(3):1293–1303.CrossrefGoogle Scholar
  • Souza RM, Morabito R, Chiyoshi F, Iannoni AP (2015) Incorporating priorities for waiting customers in the hypercube queuing model with application to an emergency medical service system in Brazil. Eur. J. Oper. Res. 242(1):274–285.CrossrefGoogle Scholar
  • Takeda RA, Widmer J, Morabito R (2007) Analysis of ambulance decentralization in an urban emergency medical service using the hypercube queueing model. Comput. Oper. Res. 34(3):727–741.CrossrefGoogle Scholar
  • van Barneveld TC, van der Mei RD, Bhulai S (2017) Compliance tables for an EMS system with two types of medical response units. Comput. Oper. Res. 80(April):68–81.CrossrefGoogle Scholar
  • van den Berg PL, Aardal K (2015) Time-dependent MEXCLP with start-up and relocation cost. Eur. J. Oper. Res. 242(2):383–389.CrossrefGoogle Scholar
  • Weaver JR, Church RL (1985) A median location model with nonclosest facility service. Transportation Sci. 19(1):58–74.LinkGoogle Scholar
  • Yun L, Qin Y, Fan H, Ji C, Li X, JiaL (2015) A reliability model for facility location design under imperfect information. Transportation Res. Part B: Methodological 81(November):596–615.CrossrefGoogle Scholar
  • Zhao P, Batta R (2000) An aggregation approach to solving the network p-median problem with link demands. Networks 36(4):233–241.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.