A Lagrangian heuristic algorithm for a public healthcare facility location problem

A Lagrangian heuristic algorithm for a public healthcare facility location problem

0.00 Avg rating0 Votes
Article ID: iaor20133950
Volume: 206
Issue: 1
Start Page Number: 221
End Page Number: 240
Publication Date: Jul 2013
Journal: Annals of Operations Research
Authors: ,
Keywords: health services, programming: integer
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.

Reviews

Required fields are marked *. Your email address will not be published.