A Mathematical Model for Medium-Term Home Health Care Planning Problem
| Affiliation auteurs | !!!! Error affiliation !!!! |
| Titre | A Mathematical Model for Medium-Term Home Health Care Planning Problem |
| Type de publication | Conference Paper |
| Year of Publication | 2019 |
| Auteurs | Liu W, Dridi M, Hassani AHajjam El, Fei H |
| Editor | Zheng F, Chu F, Liu M |
| Conference Name | PROCEEDINGS OF THE 2019 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM 2019) |
| Publisher | IEEE; Donghua Univ; Univ Evry Val dEssonne; Shanghai Jiaotong Univ; Univ Paris Est; Tongji Univ; Univ Lorraine; Fuzhou Univ; Natl Nat Sci Fdn China; I4E2; ROADEF; Glorious Sun Grp; GdR MACS |
| Conference Location | 345 E 47TH ST, NEW YORK, NY 10017 USA |
| ISBN Number | 978-1-7281-1566-5 |
| Mots-clés | Home Health Care Planning Problem, Multi-Day Planning Horizon, Vehicle Routing |
| Résumé | The mainly issue of Home Health Care (HHC) planning problem is to assign suitable caregivers to serve the demands of patients at their domiciles. This paper formulates a mixed integer programming model for medium-term home health care planning problem with minimizing the total operational cost of HHC structures. Subject to the constraints are as follows: time window and preference of patients; maximum daily working time of caregivers and their quality to serve the patients; mandatory lunch break for caregivers. Besides, a flexible departs way for each caregiver is firstly considered in this study. Finally, this model is solved by a commercial program solver Gurobi through the modified classic Periodic Vehicle Routing Problem with Time Windows (PVRPTW) benchmark instances. 12 instances were derived from original instances with up to 12 caregivers, 18 patients and 37 demands during the planning horizon. Optimal results show that the solutions perform well as this problem can be solved in a reasonable time with optimal solution. |