A Lagrangian Relaxation-Based Algorithm To Solve A Home Health Care Routing Problem

Nowadays, a rapid growth in the rate of life expectancy can be seen especially in the developed countries. accordingly, the population of elderlies has been increased. by another point of view, the number of hospitals, retirement homes along with medical staffs has not been grown with a same rate. hence, home health care (hhc) operations including a set of nurses and patients have been developed recently by both academia and health practitioners to consider elderlies’ preferences willing to receive their cares at their homes instead of hospitals or retirement homes. to alleviate the drawbacks of pervious works and make hhc more practical, this paper introduces not only a new mathematical formulation considering new suppositions in this research area but also a solution approach based on lagrangian relaxation theory has been employed for the first time. the main strategy of used algorithm aims to fill the gap between the lower bound and upper bound of problem and finds a solution which has both optimality and feasibility properties. by generating a number of numerical examples, results show the performance of the proposed algorithm analyzed by different criteria as well as the efficiency of developed formulation through a set of sensitivity analyses.