## Multi-depot routing with split deliveries: Models and a branch-and-cut algorithm

We study the split-delivery multi-depot vehicle routing problem (MDSDVRP) which combines the advantages and potential cost-savings of multiple depots and split-deliveries and develop the first exact algorithm for this problem. We propose an integer programming formulation using a comparably small number of decision variables and several sets of valid inequalities. These inequalities focus on ensuring … Read more