Using a metaheuristic algorithm for solving a home health care routing and scheduling problem

Abstract: The Health Care system is changing from the hospitalization to the home care, and the World Health Organization has announced that the rate of care-dependent elderly people in Europe will considerably increase within the next decades. Thus, scientific planning for this area is an essential factor to improve the community health. This paper aims to develop a mathematical modeling for Home Health Care Routing and Scheduling Problem and to solve it by means of Simulated Annealing (SA) algorithm considering real condition (staff vehicle traveling, conditions of patients and so forth). We permit interdependent services for patients in which they can order as many services as they want with any relation between them (Multiple Services) and supposed time window for each service. The mathematical formulation of the problem is coded in GMAS software, which is a well-known commercial software for solving optimization problems. In addition, for large-scale problems where GAMS is unable to solve, SA algorithm is applied to tackle the problems. Finally, sensitivity analysis on the most important parameters (number of services and number of patients with interdependent Multiple services) are conducted. The results reveal that when each patient can order infinite services with any relation between them, complexity of the problem increases, but SA algorithm can solve large instances with reasonable solution in the less computational time. Thus, SA algorithm shows a rational performance for large instances. Moreover, the most important factors that affect the objective value and the run time of the problems are number of patients, and number of patients with interdependent multiple services.

How to cite this paper

 Manavizadeh, N., Farrokhi-Asl, H & Beiraghdar, P. (2020). Using a metaheuristic algorithm for solving a home health care routing and scheduling problem.Journal of Project Management, 5(1), 27-40.

Refrences

Allaoua, H., Borne, S., Létocart, L., & Calvo, R. W. (2013). A matheuristic approach for solving a home health care problem. Electronic Notes in Discrete Mathematics, 41, 471-478.
Akjiratikarl, C., Yenradee, P., & Drake, P. R. (2007). PSO-based algorithm for home care worker scheduling in the UK. Computers & Industrial Engineering, 53(4), 559-583.
Axisa, F., Schmitt, P. M., Gehin, C., Delhomme, G., McAdams, E., & Dittmar, A. (2005). Flexi-ble technologies and smart clothing for citizen medicine, home healthcare, and disease pre-vention. IEEE Transactions on Information Technology in Biomedicine, 9(3), 325-336.
Azadeh, A., Baghersad, M., Farahani, M. H., & Zarrin, M. (2015). Semi-online patient schedul-ing in pathology laboratories. Artificial Intelligence in Medicine, 64(3), 217-226.
Beer, J. M., McBride, S. E., Mitzner, T. L., & Rogers, W. A. (2014). Understanding challenges in the front lines of home health care: a human-systems approach. Applied Ergonomics, 45(6), 1687-1699.
Begur, S. V., Miller, D. M., & Weaver, J. R. (1997). An integrated spatial DSS for scheduling and routing home-health-care nurses. Interfaces, 27(4), 35-48.
Bertels, S., & Fahle, T. (2006). A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem. Computers & Operations Research, 33(10), 2866-2890.
Bredström, D., & Rönnqvist, M. (2008). Combined vehicle routing and scheduling with temporal precedence and synchronization constraints. European Journal of Operational Re-search, 191(1), 19-31.
Decerle, J., Grunder, O., El Hassani, A. H., & Barakat, O. (2016). A two-phases matheuristic for the home care routing and scheduling problem. IFAC-PapersOnLine, 49(12), 1484-1489.
Eveborn, P., Flisberg, P., & Rönnqvist, M. (2006). Laps Care—an operational system for staff planning of home care. European Journal of Operational Research, 171(3), 962-976.
Fikar, C., & Hirsch, P. (2017). Home health care routing and scheduling: A review. Computers & Operations Research, 77, 86-95.
Han, S. J., Kim, H. K., Storfjell, J., & Kim, M. J. (2013). Clinical outcomes and quality of life of home health care patients. Asian Nursing Research, 7(2), 53-60.
Heching, A., & Hooker, J. N. (2016, May). Scheduling home hospice care with logic-based Benders decomposition. In International Conference on AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (pp. 187-197). Springer, Cham.
Hsieh, C. T., & Pedram, M. (1998). Microprocessor power estimation using profile-driven pro-gram synthesis. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Sys-tems, 17(11), 1080-1089.
Kergosien, Y., Lenté, C., & Billaut, J. C. (2009, August). Home health care problem: An extend-ed multiple traveling salesman problem. In Proceedings of the 4th multidisciplinary interna-tional scheduling conference: theory and applications (MISTA 2009) (pp. 85-92).
Liu, L. J., Fu, Y. F., Qu, L., & Wang, Y. (2014). Home health care needs and willingness to pay for home health care among the empty-nest elderly in Shanghai, China. International Journal of Gerontology, 8(1), 31-36.
Mankowska, D. S., Meisel, F., & Bierwirth, C. (2014). The home health care routing and sched-uling problem with interdependent services. Health Care Management Science, 17(1), 15-30.
Rabbani, M., Aghabegloo, M., & Farrokhi-Asl, H. (2017). Solving a bi-objective mathematical programming model for bloodmobiles location routing problem. International Journal of In-dustrial Engineering Computations, 8(1), 19-32.
Rasmussen, M. S., Justesen, T., Dohn, A., & Larsen, J. (2012). The home care crew scheduling problem: Preference-based visit clustering and temporal dependencies. European Journal of Operational Research, 219(3), 598-610.
Trautsamwieser, A., & Hirsch, P. (2011). Optimization of daily scheduling for home health care services. Journal of Applied Operational Research, 3(3), 124-136.
Wang, J., & Fung, R. Y. (2015). Adaptive dynamic programming algorithms for sequential ap-pointment scheduling with patient preferences. Artificial Intelligence in Medicine, 63(1), 33-40.
Xiang, W., Yin, J., & Lim, G. (2015). A short-term operating room surgery scheduling problem integrating multiple nurses roster constraints. Artificial Intelligence in Medicine, 63(2), 91-106.
Yalçındağ, S., Matta, A., Şahin, E., & Shanthikumar, J. G. (2016). The patient assignment prob-lem in home health care: using a data-driven method to estimate the travel times of care giv-ers. Flexible Services and Manufacturing Journal, 28(1-2), 304-335.