A set partitioning heuristic for the home health care routing and scheduling problem.

•We consider a home health care routing and scheduling problems practical version.•Based on a set partitioning, a new concentration heuristic approach is developed.•We present five new large neighborhood search operators fitted for the problem.•The algorithm is capable to solve real instances in at most ten minutes.•Our method provides large improvements in term of travel time and continuity of care.