.png){kind=icon}
.png){kind=icon}
Return
The two-visit team orienteering problem considering time-interval-dependent profits and service consistency
.png){kind=icon}
PRE
AI
J
J
J
K
L
E
DOI：10.1016/j.cor.2025.107370.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This study focuses on the Team Orienteering Problem with Multiple Time Windows (TOPMTW), where each vertex requires two visits. The profit of a vertex depends both on the time interval between the two visits and on the service consistency, namely whether a patient is served by the same caregiver both times. This study is motivated by some key home health care services, such as peritoneal dialysis equipment assistance, postoperative fluid injections and daily rehabilitation training. In this paper, we present a mixed-integer linear programming (MILP) model, along with an improved Adaptive Large Neighborhood Search (ALNS) algorithm. The improved ALNS algorithm incorporates a tailored time interval adjustment algorithm to further optimize the profit. Computational results demonstrate the effectiveness of the improved ALNS algorithm, highlighting its superiority over CPLEX. The incorporation of the time interval adjustment algorithm can help ALNS to obtain optimal solutions for a broader range of problem instances. The results on profits suggest that, in determining the necessity of maintaining service consistency, the influence of service duration outweighs that of the rate of profit decline across various time intervals. For services of short durations, maintaining service consistency typically leads to higher profits. Conversely, for services of long durations, service scheduling necessitates flexible adjustments to service consistency, especially when numerous conflicts of time windows arise
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
Cited Papers