A branch and bound algorithm for determining locations of long-term care facilities

This paper focuses on the problem of determining locations for long-term care facilities with the objective of balancing the numbers of patients assigned to the facilities. We present a branch and bound algorithm by developing dominance properties, a lower bounding scheme and a heuristic algorithm for obtaining an upper bound for the problem. For evaluation of the suggested branch and bound algorithm, computational experiments are performed on a number of test problems. Results of the experiments show that the suggested algorithm gives optimal solutions of problems of practical sizes in a reasonable amount of computation time.

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

[2]  Gilbert Laporte,et al.  OBJECTIVES IN LOCATION PROBLEMS. , 1995 .

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

[4]  Mark S. Daskin,et al.  Strategic facility location: A review , 1998, Eur. J. Oper. Res..

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

[6]  Qian Wang,et al.  The equitable location problem on the plane , 2007, Eur. J. Oper. Res..

[7]  Chao Yang,et al.  Two Artificial Intelligence Heuristics in Solving Multiple Allocation Hub Maximal Covering Problem , 2006, ICIC.

[8]  H. A. Eiselt Location Modeling in Practice , 1992 .

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

[10]  Esra Köktener Karasakal,et al.  A maximal covering location model in the presence of partial coverage , 2004, Comput. Oper. Res..

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

[12]  A. M. Geoffrion,et al.  Integer Programming Algorithms: A Framework and State-of-the-Art Survey , 1972 .

[13]  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..

[14]  Mark S. Daskin,et al.  What you should know about location modeling , 2008 .

[15]  Polly Bart,et al.  Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph , 1968, Oper. Res..

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

[17]  Brian Boffey,et al.  Load balancing and capacity constraints in a hierarchical location model , 2006, Eur. J. Oper. Res..

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

[19]  D. H. Marks,et al.  Location of health care facilities: An analytical approach , 1973 .

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

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

[22]  Zvi Drezner,et al.  The gravity p , 2007, Eur. J. Oper. Res..

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

[24]  T. L. Ray,et al.  Warehouse Location Under Continuous Economies of Scale , 1966 .

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

[26]  Brian Boffey,et al.  Practical aspects associated with location planning for maternal and perinatal assistance in Brazil , 2006, Ann. Oper. Res..

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

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

[29]  Mark S. Daskin,et al.  A Hierarchical Objective Set Covering Model for Emergency Medical Service Vehicle Deployment , 1981 .

[30]  M. Brandeau,et al.  An overview of representative problems in location research , 1989 .

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

[32]  Horst A. Eiselt,et al.  Location analysis: A synthesis and survey , 2005, Eur. J. Oper. Res..

[33]  Alex Alves Freitas,et al.  A Genetic Algorithm for Solving a Capacitated p-Median Problem , 2004, Numerical Algorithms.

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

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

[36]  Said Salhi,et al.  Facility Location: A Survey of Applications and Methods , 1996 .

[37]  Alfred A. Kuehn,et al.  A Heuristic Program for Locating Warehouses , 1963 .