Abstract: A vehicle routing problem for servicing objects with the possibility of distributing work between vehicle taking into account time windows is considered. Large neighborhood search algorithms with different types of neighborhoods are developed. Here an improving solution is constructed using the “destroy” and “repair” methods at each step. The “repair” operators are based on solving mixed integer subproblems of reduced dimentions. An experimental evaluation shows that the algorithms demonstrate competitive results.

Cite: Zaozerskaya L. , Zakharova Y.
Large neighborhood search for split delivery vehicle routing problem with time windows
XXIII International Conference Mathematical Optimization Theory and Operations Research 30 Jun - 6 Jul 2024