Task-splitting in home healthcare routing and scheduling
Loek van Montfort, Wout Dullaert, Markus Leitner

TL;DR
This paper explores task-splitting in home healthcare routing, proposing MILP models and heuristics to optimize caregiver scheduling, reducing costs and staff requirements.
Contribution
It introduces two MILP formulations and heuristics for integrating task-splitting into home healthcare routing and scheduling.
Findings
Task-splitting increases computational complexity.
Heuristics improve solution quality and speed.
Integrating task-splitting reduces operational costs.
Abstract
This paper introduces the concept of task-splitting into home healthcare (HHC) routing and scheduling. It focuses on the design of routes and timetables for caregivers providing services at patients' homes. Task-splitting is the division of a (lengthy) patient visit into separate visits that can be performed by different caregivers at different times. The resulting split parts may have reduced caregiver qualification requirements, relaxed visiting time windows, or a shorter/longer combined duration. However, additional temporal dependencies can arise between them. To incorporate task-splitting decisions into the planning process, we introduce two different mixed integer linear programming formulations, a Miller-Tucker-Zemlin and a time-indexed variant. These formulations aim to minimize operational costs while simultaneously deciding which visits to split and imposing a potentially wide…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
