A tabu search heuristic for the vehicle routing problem with time windows and split deliveries

The routing of a fleet of vehicles to service a set of customers is important in the field of distribution. Vehicle routing problems (VRP) arise in many real-life applications within transportation and logistics. In this paper, we study a variant of the general VRP, VRP with time windows and split deliveries (VRPTWSD). Time constrained routing is relevant for applications where a schedule has to be followed. The option of splitting a demand...