Research on Underway Replenishment Path Planning Considering Time Window

The traditional underway replenishment path planning model takes the minimum sailing time as the optimization objective, does not consider the time window factor, and therefore does not consider the impossible waiting replenishment time, which is not applicable to the situation where replenishment is prohibited for multiple time periods. In this paper, the problem of underway replenishment path planning considering time window is analogized as Traveling Salesman Problem with Time Windows. Considering that the time of wartime underway replenishment is tight, and the time window for replenishment by supply ships is mostly the time window for prohibiting replenishment, an underway replenishment path planning model with minimum replenishment time as the goal was designed. Finally, an improved genetic algorithm is designed to solve the problem, and the feasibility of the method is verified by an example.