The study focuses on the issue of vehicle routing with time windows, where vehicle plans need to be connected in sequences over a long time horizon. The researchers propose a new problem formulation that considers potential delays within given time windows. They also introduce a method to solve this problem, proving its optimality and analyzing its complexity. The method is tested through a demonstration of solving the static Dial-a-ride problem, showing it provides better solutions than two other heuristic methods evaluated, without requiring the most computational time.

 

Publication date: 8 Jan 2024
Project Page: https://arxiv.org/abs/2401.02873
Paper: https://arxiv.org/pdf/2401.02873

Post Views: 233