A two-stage matheuristic for the home healthcare routing and scheduling problem with perishable products

• Main Authors: GUNAWAN, Aldy, SALSABILA, Nabila Yuraisyah, YU, Vincent F., NGUYEN, Pham Kien Minh
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2024
• Subjects: Artificial Intelligence and Robotics; Databases and Information Systems
• Online Access: https://ink.library.smu.edu.sg/sis_research/9611; https://ink.library.smu.edu.sg/context/sis_research/article/10611/viewcontent/CASE_2024___paperID_480.pdf
• Institution: Singapore Management University

This study proposes a home healthcare routing and scheduling problem, where perishable products such as medicines, vaccines, or meals must be provided for some patients’ treatments. This problem is formulated as a mixed integer linear programming (MILP). A two-stage matheuristic is then developed as the solution approach. The first stage is a local search to solve the nurse routing problem, and the second stage is run as the relaxed MILP to solve the scheduling problem. The matheuristic is tested on newly generated instances and compared with the results of CPLEX. The proposed matheuristic is able to obtain CPLEX solutions within shorter computational times for small instances. For larger instances, the matheuristic achieves feasible solutions.