2008-06               2008.7. 23

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

Dong-Guen Kim, Yeong-Dae Kim

Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, Korea

ABSTRACT: This paper focuses on the problem of determining locations of long-term care facilities for 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.

KET WORDS: facility location problem, long-term care facility, branch and bound