Alkaid-SDVRP: An Efficient Open-Source Solver for the Vehicle Routing Problem with Split Deliveries.

This article presents Alkaid-SDVRP, an open-source C++ software package designed to efficiently solve the Vehicle Routing Problem with Split Deliveries (SDVRP), a variant of the Capacitated Vehicle Routing Problem allowing multiple vehicles to serve the same customer. The core algorithm integrates Iterated Local Search with a Randomized Variable Neighborhood Descent framework, featuring configurable neighborhoods including a novel SD-Swap* operator, and employs a Lazy Static Move Descriptor to enhance search efficiency. Tested on the 12th DIMACS Implementation Challenge, Alkaid-SDVRP achieved first place in the SDVRP track, demonstrating state-of-the-art performance. The package offers a flexible, extensible interface for research and practical applications, supporting customizable acceptance rules, perturbation methods, and neighborhood operators. The authors also discuss future directions for improving the algorithm’s modularity and search scope control to further advance SDVRP solution methods.