A Lagrangian heuristic algorithm for a public healthcare facility location problem

We consider a healthcare facility location problem in which there are two types of patients, low-income patients and middle- and high-income patients. The former can use only public facilities, while the latter can use both public facilities and private facilities. We focus on the problem of determining locations of public healthcare facilities to be established within a given budget and allocating the patients to the facilities for the objective of maximizing the number of served patients while considering preference of the patients for the public and private facilities. We present an integer programming formulation for the problem and develop a heuristic algorithm based on Lagrangian relaxation and subgradient optimization methods. Results of computational experiments on a number of problem instances show that the algorithm gives good solutions in a reasonable computation time and may be effectively used by the healthcare authorities of the government.

[1]  Oded Berman,et al.  Competitive facility location and design problem , 2007, Eur. J. Oper. Res..

[2]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[3]  Dong-Guen Kim,et al.  A branch and bound algorithm for determining locations of long-term care facilities , 2010, Eur. J. Oper. Res..

[4]  Vladimir Marianov,et al.  The Queueing Maximal availability location problem: A model for the siting of emergency vehicles , 1996 .

[5]  D. Hochbaum.  Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems , 1996 .

[6]  Brian Boffey,et al.  A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem , 2000, Eur. J. Oper. Res..

[7]  Mark S. Daskin,et al.  Location of Health Care Facilities , 2005 .

[8]  Jafar Fathali,et al.  Solving the p-median problem with pos/neg weights by variable neighborhood search and some results for special cases , 2006, Eur. J. Oper. Res..

[9]  Mauricio G. C. Resende,et al.  A fast swap-based local search procedure for location problems , 2007, Ann. Oper. Res..

[10]  Young-hoon Lee,et al.  The Multi-period Demand Changing Location Problem , 2007 .

[11]  S. Hakimi.  On locating new facilities in a competitive environment , 1983 .

[12]  José Muñoz-Pérez,et al.  Competitive location with rectilinear distances , 1995 .

[13]  Zvi Drezner,et al.  Location of a facility minimizing nuisance to or from a planar network , 2009, Comput. Oper. Res..

[14]  Kerstin Dächert,et al.  Allocation search methods for a generalized class of location-allocation problems , 2009, Eur. J. Oper. Res..

[15]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

[16]  Justin C. Williams,et al.  Solving the maximal covering location problem with heuristic concentration , 2008, Comput. Oper. Res..

[17]  Vedat Verter,et al.  Designing emergency response networks for hazardous materials transportation , 2007, Comput. Oper. Res..

[18]  George O. Wesolowsky,et al.  Planar maximal covering location problem under block norm distance measure , 2007, J. Oper. Res. Soc..

[19]  Oded Berman,et al.  Locating Multiple Competitive Facilities: Spatial Interaction Models with Variable Expenditures , 2002, Ann. Oper. Res..

[20]  Samad Ahmadi,et al.  Guided construction search metaheuristics for the capacitated p-median problem with single source constraint , 2007, J. Oper. Res. Soc..

[21]  Hesham K. Alfares,et al.  Modeling health care facility location for moving population groups , 2008, Comput. Oper. Res..

[22]  Trevor S. Hale,et al.  Location Science Research: A Review , 2003, Ann. Oper. Res..

[23]  Ronald G. McGarvey,et al.  Constrained location of competitive facilities in the plane , 2005, Comput. Oper. Res..

[24]  Vedat Verter,et al.  Incorporating congestion in preventive healthcare facility network design , 2009, Eur. J. Oper. Res..

[25]  Young Hoon Lee,et al.  The Maximal Covering Location Problem with Cost Restrictions , 2004 .

[26]  Frank Plastria,et al.  Discrete models for competitive location with foresight , 2008, Comput. Oper. Res..

[27]  Vedat Verter,et al.  Location of Preventive Health Care Facilities , 2002, Ann. Oper. Res..

[28]  Stefano Benati,et al.  An Improved Branch & Bound Method for the Uncapacitated Competitive Location Problem , 2003, Ann. Oper. Res..

[29]  José Muñoz,et al.  A neural model for the p-median problem , 2008, Comput. Oper. Res..

[30]  David K. Smith,et al.  Use of location-allocation models in health service development planning in developing nations , 2000, Eur. J. Oper. Res..

[31]  Charles S. ReVelle,et al.  The Location of Emergency Service Facilities , 1971, Oper. Res..

[32]  Maged Dessouky,et al.  A modeling framework for facility location of medical services for large-scale emergencies , 2007 .

[33]  Vladimir Marianov,et al.  Optimal location of public health centres which provide free and paid services , 2001, J. Oper. Res. Soc..

[34]  Luiz Antonio Nogueira Lorena,et al.  A column generation approach to capacitated p-median problems , 2004, Comput. Oper. Res..

[35]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[36]  Yeong-Dae Kim,et al.  Plant location and procurement planning in knockdown production systems , 2001, J. Oper. Res. Soc..

[37]  Taesik Lee,et al.  Heuristics for Locating Two Types of Public Health-Care Facilities , 2012 .

[38]  P. Marcotte,et al.  A bilevel model for preventive healthcare facility network design with congestion , 2010 .