Why optimization and continuity go together
Home care visit planning is an integrated problem: which visits should which caregiver perform, in what order, and within which time windows? At the same time we want each client to see as few different caregivers as possible over time – continuity – and work to be distributed fairly. This requires both efficient routes and clear targets for continuity and special requirements.
Research and practice model this as a variant of the Vehicle Routing Problem with Time Windows (VRPTW), extended with skill matching, synchronized visits (double-staff), and soft continuity. Solution methods include Mixed-Integer Linear Programming (MILP), Constraint Programming (CP), column generation, and metaheuristics such as ALNS. The methodology makes trade-offs between travel time, continuity, and clear scheduling measurable for the operation's own data.
Optimization objectives
Planning balances several goals:
- Minimize travel and wait time so more time is spent on actual care.
- Maximize continuity – fewer unique caregivers per client over the planning horizon.
- Even distribution of workload and number of visits across caregivers.
- Clear scheduling: time windows, skill matching, double-staff visits, and labor rules (breaks, shift length) so the schedule is feasible and easy to follow.
Efficiency: how we measure it
Routing efficiency measures the share of time used for visits, travel, and waiting that is actually spent on visits. Idle time (unassigned time within shifts) and empty shifts are excluded from the denominator – so we measure pure routing quality.
routing_efficiency = visit_time / (visit_time + travel_time + wait_time)
Evaluate routing efficiency against the provider's own accepted baseline and service requirements; no universal percentage proves a deployable schedule.
Continuity of care
Continuity (CoC) means the same client sees as few different caregivers as possible over the planning period. It is modeled e.g. by limiting the number of allowed caregivers per client (pool), by penalizing reassignments in a rolling horizon, or by using blueprint routes for recurring visits.
In practice continuity is combined with efficiency: first build a feasible solution that respects time windows and skills, then compare provider-owned continuity and assignment targets across equivalent runs.
Algorithms and methods
The literature and real-world systems use among others:
- VRP with time windows (VRPTW) plus extensions for skills, synchronization, and continuity.
- Constraint programming (CP) to quickly find feasible schedules that are then improved with e.g. ALNS.
- Column generation and branch-and-price, or Logic-Based Benders Decomposition, to separate assignment/rostering from routing.
- Adaptive Large Neighborhood Search (ALNS/LNS) and hybrid methods (e.g. CP + LNS) for large instances and dynamic settings.
Sources and further reading
- Routing and scheduling in Home Health Care: A Literature Survey and Bibliometric Analysis (HAL)
- A Review of Home Health Care Routing and Scheduling Problems (HHCRSP) – Engineering journal review
- Balancing continuity of care and home care schedule costs using blueprint routes (ScienceDirect)
- Home Healthcare Staffing, Routing, and Scheduling Problem (Wiley – Networks)
- Logic-Based Benders Approach to Home Healthcare Delivery (INFORMS Transportation Science)
Summary
Efficient visit planning in home care requires strong algorithms (VRP, CP, decomposition, metaheuristics), clear targets for efficiency and continuity, and clear scheduling. Mathematical optimization lets operators compare those trade-offs against their own data and constraints.
Caire builds on these principles in its route and scheduling engine. To see how travel time, continuity, and clear scheduling are compared in practice, explore our route optimization feature or get in touch.
Explore Caire route optimization
Compare travel time, continuity, and clear scheduling for your operation's planning inputs.
Route optimization for home care