Optimizing Multi-period Vehicle Routing with Time Windows and Synchronization: A Novel Discrete Event Heuristic Approach
摘要
In the dynamic and complex environment of service sector logistics, planning for multiple periods is crucial for long-term operational vision. The Multi-period Vehicle Routing Problem with Time Windows and Synchronization addresses these challenges by focusing on efficient vehicle scheduling that requires synchronized actions among drivers. Our approach introduces a novel heuristic-constructive approach, introducing the flexibility and efficiency of Discrete Event Heuristic algorithm to provide high-quality solutions, aiming to minimize the overall duration needed for task completion, considering the proximity of tasks and delays caused by the need for synchronization.