Answers are grounded in this paper and cite their sources.
This research investigates the home health care routing and scheduling problem with soft time windows and perishable medicines (HHCRSP-STW-PM), where care crews must serve patients over multiple periods while accounting for skill-based assignments, medicine perishability, and flexible service times. The objective minimizes total travel and penalty costs for early or late services. We formulate a mixed integer linear program (MILP) model to optimally solve small instances and develop an effective greedy randomized adaptive search procedure (GRASP) to address large instances. GRASP includes a tailored construction heuristic with problem-specific local search operators in the local search phase. Numerical experiments conducted on newly generated instances demonstrate that while the MILP model provides optimal solutions for small instances, only GRASP is able to handle large-scale instances within a reasonable computational time. Sensitivity analyses allow us to examine the impact of the approach’s parameters, perishability of medicine, soft time windows, and care crew resources.
No takes yet. Share an insight, caveat, or question.
Yu et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: