A Lagrangian heuristic algorithm for a public healthcare facility location problem

Cited 13 time in webofscience Cited 0 time in scopus
  • Hit : 396
  • Download : 0
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.
Publisher
SPRINGER
Issue Date
2013-07
Language
English
Article Type
Article
Keywords

P-MEDIAN PROBLEM; COMPETITIVE LOCATION; NETWORK DESIGN; SEARCH; MODELS; CONGESTION; SERVICES

Citation

ANNALS OF OPERATIONS RESEARCH, v.206, no.1, pp.221 - 240

ISSN
0254-5330
DOI
10.1007/s10479-013-1378-4
URI
http://hdl.handle.net/10203/175503
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 13 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0