Answers are grounded in this paper and cite their sources.
In traditional home health care (HHC), caregivers are disatched individually in separate vehicles to serve patients at home. This approach may struggle to provide timely service when handling concentrated demand in densely populated areas, particularly when patients require care from multiple caregivers simultaneously, also known as synchronized visits. Motivated by real-world HHC practices, this paper presents a novel team-based home health care routing and scheduling problem with synchronized visits. In this problem, vehicles deliver caregiver teams to patients’ homes, where caregivers then walk together or individually to visit patients at the drop-off points and other nearby patients. The main novelty of this study lies in treating the size of each team and the skill composition of its members as decision variables, while capturing the two-echelon routing and scheduling framework induced by vehicle sharing and walking. A mixed-integer programming model is proposed for this problem, and an adaptive large neighborhood search (ALNS) with eight tailored destroy-repair operators is employed to generate solutions. To further enhance its performance, two heuristics are introduced to optimize team composition and departure times from the HHC center. Computational results from both small-scale and large-scale test instances indicate the superiority of the proposed algorithm. Additionally, the sensitivity and service model comparative analyses provide valuable insights for HHC centers. Most notably, the team-based service model outperforms the traditional individual-caregiver model in terms of lower total cost, fewer vehicles, and shorter travel distances, particularly under conditions of high patient clustering and synchronized visits.
No takes yet. Share an insight, caveat, or question.
Wang et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: