Publication Type
Conference Proceeding Article
Version
acceptedVersion
Publication Date
9-2024
Abstract
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.
Discipline
Artificial Intelligence and Robotics | Databases and Information Systems
Research Areas
Data Science and Engineering; Intelligent Systems and Optimization
Areas of Excellence
Sustainability
Publication
Proceedings of the 20th Annual IEEE International Conference on Automation Science and Engineering (IEEE CASE 2024)
Publisher
IEEE
City or Country
New York
Citation
GUNAWAN, Aldy; SALSABILA, Nabila Yuraisyah; YU, Vincent F.; and NGUYEN, Pham Kien Minh.
A two-stage matheuristic for the home healthcare routing and scheduling problem with perishable products. (2024). Proceedings of the 20th Annual IEEE International Conference on Automation Science and Engineering (IEEE CASE 2024).
Available at: https://ink.library.smu.edu.sg/sis_research/9611
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.