.png){kind=icon}
.png){kind=icon}
Return
A matheuristic for the home healthcare routing and scheduling problem with ferry-dependent travel times
.png){kind=icon}
OA
AI
A
S
L
DOI：10.1016/j.cor.2025.107372.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• First study integrating ferry timetables into home healthcare routing and scheduling. • MILP model that considers time windows, skill matching, and synchronization constraints. • Two-phase matheuristic using sequential graph expansion and weighted proximity search. • Outperforms direct solving and classical proximity search on realistic Norwegian instances. • Solves up to 30 patients optimally, and 80 patients with high-quality feasible solutions.
Keywords:
Home healthcare routing and scheduling
Ferry-dependent travel times
Mixed-integer linear programming
Weighted proximity search
Synchronization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
No organization information available
Cited Papers