Skip to main content
SpringerLink
Log in

A Lagrangian heuristic algorithm for a public healthcare facility location problem

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  • Aboolian, R., Berman, O., & Krass, D. (2007). Competitive facility location and design problem. European Journal of Operational Research, 183, 40–62.

    Article  Google Scholar 

  • Benati, S. (2003). An improved branch & bound method for the uncapacitated competitive location problem. Annals of Operations Research, 122, 43–58.

    Article  Google Scholar 

  • Berman, O., & Krass, D. (2002). Expenditures locating multiple competitive facilities: spatial interaction models with variable expenditures. Annals of Operations Research, 111, 197–225.

    Article  Google Scholar 

  • Berman, O., Verter, V., & Kara, B. Y. (2007). Designing emergency response networks for hazardous materials transportation. Computers and Operations Research, 34, 1374–1388.

    Article  Google Scholar 

  • Bischoff, M., & Dachert, K. (2009). Allocation search methods for a generalized class of location–allocation problems. European Journal of Operational Research, 192, 793–807.

    Article  Google Scholar 

  • Choi, S. S., & Lee, L. H. (2007). The multi-period demand changing location problem. Journal of the Korean Institute of Industrial Engineers, 33, 439–446.

    Google Scholar 

  • Colin, R. R. (1993). Modern heuristic techniques for combinatorial problems (pp. 243–298). New York: Wiley.

    Google Scholar 

  • Daskin, M. S., & Dean, L. K. (2004). 3. Location of Health Care Facilities. In M. L. Brandeau, F. Sainfort, & W. P. Pierskalla (Eds.), Operations research and health care (pp. 43–76). Dordrecht: Kluwer Academic.

    Google Scholar 

  • Dominguez, E., & Munoz, J. (2008). A neural model for the p-median problem. Computers and Operations Research, 35, 404–416.

    Article  Google Scholar 

  • Drezner, Z., Drezner, Z., & Scott, C. H. (2009). Location of a facility minimizing nuisance to or from a planar network. Computers and Operations Research, 36, 135–148.

    Article  Google Scholar 

  • Fathali, J., & Kakhki, H. T. (2006). Solving the p-median problem with pos/neg weights by variable neighborhood search and some results for special cases. European Journal of Operational Research, 170, 440–462.

    Article  Google Scholar 

  • Fisher, M. L. (1981). The Lagrangean relaxation method for solving integer programming problems. Management Science, 27, 1–18.

    Article  Google Scholar 

  • Galvao, R. D., Espejo, L. G., & Boffey, B. (2000). A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem. European Journal of Operational Research, 124, 377–389.

    Article  Google Scholar 

  • Hakimi, S. L. (1983). On locating new facilities in a competitive environment. European Journal of Operational Research, 12, 29–35.

    Article  Google Scholar 

  • Hale, T., & Moberg, C. (2003). Location science research: a review. Annals of Operational Research, 123, 21–35.

    Article  Google Scholar 

  • Hong, S. H., & Lee, Y. H. (2004). The maximal covering location problem with cost restrictions. Journal of the Korean Institute of Industrial Engineers, 30, 93–106.

    Google Scholar 

  • Hochbaum, D. S. (1997). Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems. In Approximation algorithms for NP-hard problems (pp. 94–143). Boston: PWS-Kent.

    Google Scholar 

  • Infante-Macias, R., & Mufioz-Perez, J. (1995). Competitive location with rectilinear distances. European Journal of Operational Research, 80, 77–85.

    Article  Google Scholar 

  • Jia, H., Ordonez, F., & Dessouky, M. (2007). A modeling framework for facility location of medical services for large-scale emergencies. IIE Transactions, 39, 41–55.

    Article  Google Scholar 

  • Kim, D. G., & Kim, Y.-D. (2010). A branch and bound algorithm for determining locations of long-term care facilities. European Journal of Operational Research, 206, 168–177.

    Article  Google Scholar 

  • Kim, D.-G., Kim, Y.-D., & Lee, T. (2012). Heuristics for locating two types of public health-care facilities. Industrial Engineering & Management Systems, 11, 202–214.

    Article  Google Scholar 

  • Lim, S. K., & Kim, Y.-D. (2001). Plant location and procurement planning in knockdown production systems. Journal of the Operational Research Society, 52, 271–282.

    Article  Google Scholar 

  • Lorena, L. A. N., & Senne, E. L. F. (2004). Guided construction search metaheuristics for the capacitated p-median problem with single source constraint. Computers and Operations Research, 31, 863–876.

    Article  Google Scholar 

  • Marianov, V., & ReVelle, C. (1996). The queueing maximal availability location problem: a model for the siting of emergency vehicles. European Journal of Operational Research, 93, 110–120.

    Article  Google Scholar 

  • Marianov, V., & Taborga, P. (2001). Optimal location of public health centers which provide free and paid services. Journal of the Operational Research Society, 52, 391–400.

    Article  Google Scholar 

  • McGarvey, R. G., & Cavalier, T. M. (2005). Constrained location of competitive facilities in the plane. Computers and Operations Research, 32, 359–378.

    Article  Google Scholar 

  • Ndiaye, M., & Alfares, H. (2008). Modeling health care facility location for moving population groups. Computers and Operations Research, 35, 2154–2161.

    Article  Google Scholar 

  • Osman, I. H., & Ahmadi, S. (2007). Guided construction search metaheuristics for the capacitated p-median problem with single source constraint. Journal of the Operational Research Society, 58, 100–114.

    Article  Google Scholar 

  • Plastria, F., & Vanhaverbekea, L. (2008). Discrete models for competitive location with foresight. Computers and Operations Research, 35, 683–700.

    Article  Google Scholar 

  • Rahman, S., & Smith, D. K. (2000). Use of location-allocation models in health service development planning in developing nations. European Journal of Operational Research, 123, 437–452.

    Article  Google Scholar 

  • Resende, M. G., & Werneck, R. F. (2007). A fast swap-based local search procedure for location problems. Annals of Operations Research, 150, 205–230.

    Article  Google Scholar 

  • ReVelle, C., Scholssberg, M., & Williams, J. (2008). Solving the maximal covering location problem with heuristic concentration. Computers and Operations Research, 35, 427–435.

    Article  Google Scholar 

  • Toregas, C., Swain, R., ReVelle, C., & Bergman, L. (1971). The location of emergency service facilities. Operations Research, 19, 1363–1373.

    Article  Google Scholar 

  • Verter, V., & Lapierre, S. D. (2002). Location of preventive health care facilities. Annals of Operations Research, 110, 123–132.

    Article  Google Scholar 

  • Younies, H., & Wesolowsky, G. O. (2007). Planar maximal covering location problem under block norm distance measure. Journal of the Operational Research Society, 58, 740–750.

    Article  Google Scholar 

  • Zhang, Y., Berman, O., & Verter, V. (2009). Incorporating congestion in preventive healthcare facility network design. European Journal of Operational Research, 198, 922–935.

    Article  Google Scholar 

  • Zhang, Y., Berman, O., Marcotte, P., & Verter, V. (2010). A bilevel model for preventive healthcare facility network design with congestion. IIE Transactions, 42, 865–880.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. R&D Feasibility Analysis Center, Korea Institute of Science and Technology Evaluation and Planning, Seocho-gu, Seoul, 137-130, Korea

    Dong-Guen Kim

  2. Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, Yuseong-gu, Daejeon, 305-701, Korea

    Yeong-Dae Kim

Authors
  1. Dong-Guen Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yeong-Dae Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dong-Guen Kim.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kim, DG., Kim, YD. A Lagrangian heuristic algorithm for a public healthcare facility location problem. Ann Oper Res 206, 221–240 (2013). https://doi.org/10.1007/s10479-013-1378-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-013-1378-4

Keywords

Search

Navigation