The design of capacitated facility networks for long term care service

Cited 6 time in webofscience Cited 0 time in scopus
  • Hit : 233
  • Download : 0
Life expectancy is going up and the demand of long term care facilities is increasing in most countries. This study deals with designing problem of facility networks for long-term care services in a city consisting of a number of regions. Assuming that in each region a candidate site for long-term care facility exists, we seek to identify regions where opening of a long-term care facility is desirable and also determine the type of new facility. For the problem, an integer programming model is formulated with the objective of minimizing the total construction cost. The closest assignment rule is adopted to reflect the preference of patient in choosing long term care facility by assigning patient to an open facility closest from his home. To solve the model, we develop a branch and bound algorithm for exact solution and a genetic algorithm to solve large sized problem. The validity of the mathematical model and the proposed algorithms are illustrated through a number of problem instances.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
2015-11
Language
English
Article Type
Article
Keywords

COVERING LOCATION PROBLEM; EMERGENCY VEHICLES; BOUND ALGORITHM

Citation

COMPUTERS & INDUSTRIAL ENGINEERING, v.89, pp.177 - 185

ISSN
0360-8352
DOI
10.1016/j.cie.2015.03.010
URI
http://hdl.handle.net/10203/205165
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 6 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0