An effective heuristic for the Pmedian problem with application to ambulance location
 Michael Dzator,
 Janet Dzator
 … show all 2 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
We consider the pmedian problem which is to find the location of pfacilities so as to minimize the average weighted distance or time between demand points and service centers. Many heuristic algorithms have been proposed for this problem. In this paper we present a simple new heuristic which is effective for moderately size problem. The heuristic uses a reduction and an exchange procedure. Our methodology is tested on 400 randomly generated problems with 10 to 50 customer locations as well as 6 well known literature test problems. We also compare our method with the Branch and Bound method in terms of quality and computational time using a larger problem size of 150 customer locations. For the random problems the generated solutions were on average within 0.61 % of the optimum. A similar result was achieved for the literature test problems. A comparative analysis with literature heuristics supports the superiority of our method. The computational time of our heuristic is 0.75 % of the Branch and Bound Method. We also apply our heuristic to a case study involving the location of emergency vehicles (ambulances) in Perth City (Australia).
 Savas, E (1969) Simulation and costeffectiveness analysis of New York’s emergency ambulance service. Manag. Sci. 15: pp. 608627 CrossRef
 Fitzsimmons, JA (1973) A methodology for emergency ambulance deployment. Manag. Sci. 19: pp. 627636 CrossRef
 Swoveland, C, Uyeno, D, Vertinsky, I, Vickson, R (1973) Ambulance location: a probabilistic enumeration approach. Manag. Sci. 20: pp. 687697 CrossRef
 Gendreau, M, Laporte, G, Semet, F (1998) Solving an ambulance location model by Tabu Search. Locat. Sci. 5: pp. 7588 CrossRef
 Repede, JF, Bernando, JJ (1994) Developing and validating a decision support system for locating emergency medical vehicles in Louisville, Kentucky. Eur. J. Oper. Res. 75: pp. 567581 CrossRef
 McAleer, WE, Naqvi, IA (1994) The relocation of ambulance stations: a successful case study. Eur. J. Oper. Res. 75: pp. 582588 CrossRef
 Goldberg, JR, Dietrich, R, Cheng, JM, Mitwasi, MG, Valenzuela, T, Criss, E (1990) Validating and applying a model for locating emergency medical vehicles in Tucson, AZ (case study). Eur. J. Oper. Res. 49: pp. 308324 CrossRef
 Fujiwara, O, Makjamroen, T, Gruta, KK (1987) Ambulance deployment analysis: a case study of Bangkok. Eur. J. Oper. Res. 31: pp. 918 CrossRef
 Calvo, A, Marks, H (1973) Location of health care facilities: an analytical approach. Socio Econ. Plan. Sci. 7: pp. 407422 CrossRef
 Berlin, G, Revelle, C, Elzinga, J (1976) Determining ambulancehospital locations for onscene and hospital services. Environ. Plan. A 8: pp. 553561 CrossRef
 Mirchandani, PB (1980) Locational decisions on stochastic networks. Geogr. Anal. 12: pp. 172183 CrossRef
 Carson, Y, Batta, R (1990) Locating an ambulance on Amherst campus of State University of New York at Buffalo. Interfaces 20: pp. 4349 CrossRef
 Serra, D, Marianov, V (1998) The pmedian problem in a changing network: the case of Barcelona. Locat. Sci. 6: pp. 383394 CrossRef
 Paluzzi, M.: Testing a Heuristic pMedian Location Allocation Model for Siting Emergency Service Facilities. Paper presented at annual meeting of association of American Geographers, Philadelphia, PA (2004)
 Caccetta, L., Dzator, M.: Models for the location of emergency facilities. In: Proceedings Modsim 2001. (2001)
 Caccetta, L., Dzator, M.: Heuristics methods for locating emergency facilities. In: Proceedings Modsim 2005. (2005)
 Dzator, M.: Facility Location in Cities: the Optimal Location of Emergency Unit Within Cities. VDM Verlag (2008)
 Uyeno, D.H., Seeberg, C.: A practical methodology for ambulance location. Simul. 79–87 (1984)
 Maranzana, FE (1964) On the location of supply points to minimize transport costs. Oper. Res. Q. 15: pp. 261270 CrossRef
 Teitz, MB, Bart, P (1968) Heuristic methods for estimating generalized vertex median of a weighted graph. Oper. Res. 16: pp. 955961 CrossRef
 Hakimi, SL (1964) Optimisation locations of switching centres and the absolute centres and medians of a graph. Oper. Res. 12: pp. 450459 CrossRef
 Kariv, O, Hakimi, SL (1979) An algorithmic approach to network location problems II: the pmedians. SIAM J. Appl. Math. 37: pp. 539560 CrossRef
 Daskin, MS (1995) Network and discrete location: models, algorithms and applications. Wiley, New York CrossRef
 Eaton, DJ, Daskin, MS, Simmons, D, Bulloch, B, Jansma, G (1985) Determining emergency medical service vehicle deployment in Austin, Texas. Interfaces 15: pp. 96108 CrossRef
 Toregas, C, Swain, R, ReVelle, C, Bergman, L (1971) The location of emergency service facilities. Oper. Res. 19: pp. 13631373 CrossRef
 Plane, DR, Hendrick, TE (1977) Mathematical programming and the location of fire companies for Denver fire department. Oper. Res. 25: pp. 563578 CrossRef
 Densham, PJ, Rushton, G (1992) A more efficient heuristic for solving large pmedian problems. Pap. Reg. Sci. 71: pp. 307329 CrossRef
 Ashayeri, J, Heuts, R, Tammel, B (2005) A modified simple heuristic for the pmedian problem, with facilities design applications. Robot Comput. Integ. Manuf. 21: pp. 451464 CrossRef
 Chiyoshi, F, Galvao, RD (2000) A statistical analysis of simulated annealing applied to the pmedian problem. Ann. Oper. Res. 96: pp. 6174 CrossRef
 Righini, G (1995) A double annealing algorithm for discrete location/allocation problems. Eur. J. Oper. Res. 86: pp. 452468 CrossRef
 Alp, O, Erkut, E, Drezner, Z (2003) An efficient genetic algorithm for the pmedian problem. Ann. Oper. Res. 122: pp. 2142 CrossRef
 Bozkaya, B., Zhang, J., Erkut, E.: An efficient genetic algorithm for the pmedian problem. In: Drezner, Z., Hamacher, H. (eds.) Facility Location: Applications and Theory, pp. 179–205 (2002)
 Chiou, Y, Lan, LW (2001) Genetic clustering algorithms. Eur. J. Oper. Res. 135: pp. 413427 CrossRef
 Dvorett, J.: CompatibilityBased Genetic Algorithm. A New Approach to the pMedian Problem. Technical Report, Department of Industrial Engineering and Management, Northwestern University, Evanston, IL (1999)
 Salhi, S (2002) Defining Tabu list size and aspiration criterion within Tabu search methods. Comput. Oper. Res. 29: pp. 6786 CrossRef
 Rolland, E, Schilling, DA, Current, JR (1996) An efficient Tabu search procedure for the pmedian problem. Eur. J. Oper. Res. 96: pp. 7586
 Voss, S (1996) A reverse elimination approach for the pmedian problem. Stud. Locat. Anal. 8: pp. 4958
 Swain, R.: A Decomposition Algorithm for a Class of Facility Location Problems. Unpublished Ph. D. dissertation, Cornell University, Ithaca, NY (1971)
 Dantzig, GB, Fulkerson, DR, Johnson, SM (1954) Solution of a largescale traveling salesman problem. Oper. Res. 2: pp. 393410 CrossRef
 Karg, RL, Thompson, GL (1964) A heuristic approach to solving traveling salesman problem. Manag. Sci. 10: pp. 225248 CrossRef
 Hribar, M, Daskin, MS (1997) A dynamic programming heuristic for the pmedian problem. Eur. J. Oper. Res. 101: pp. 499508 CrossRef
 Khumawala, BM (1973) An efficient algorithm for the pmedian problem with maximum distance constraints. Geogr. Anal. 5: pp. 309321 CrossRef
 Hillman, EL, Rushton, G (1975) The pmedian problem with maximum distance constraints: a comment. Geogr. Anal. 7: pp. 8589 CrossRef
 Church, RL, Meadows, ME (1979) Location modeling utilizing maximum distance criteria. Geogr. Anal. 11: pp. 358373 CrossRef
 Neebe, AW (1988) A procedure for locating emergency service facilities for all possible response distances. J. Oper. Res. Soc. 39: pp. 743748
 Rahman, S, Smith, DK (1991) A comparison of two heuristic methods for the pmedian problem with and without maximum distance constraints. Int. J. Oper. Prod. Manag. 11: pp. 7684 CrossRef
 Government of Western Australia Department of Health Annual Report 2009/10. Available at http://www.health.wa.gov.au/publication annual report 2010 DOH.cfm
 Ahern, T.: St John ambulance annual report 2009/10. Available at http://www.ambulance.net.au/content.asp?id.176. (2010)
 Travelmate, http://www.travelmate.com.au/MapMaker/MapMaker.asp
 Title
 An effective heuristic for the Pmedian problem with application to ambulance location
 Journal

OPSEARCH
Volume 50, Issue 1 , pp 6074
 Cover Date
 20130301
 DOI
 10.1007/s125970120098x
 Print ISSN
 00303887
 Online ISSN
 09750320
 Publisher
 SpringerVerlag
 Additional Links
 Topics
 Keywords

 Heuristics
 Facilities
 Location
 Pmedian problem
 Authors

 Michael Dzator ^{(1)}
 Janet Dzator ^{(2)}
 Author Affiliations

 1. Department of Mathematics, The University of Newcastle, Callaghan, New South Wales, Australia
 2. School of Business, The University of Newcastle, Callaghan, New South Wales, Australia