Some experiments with a savings heuristic and a tabu search approach for the vehicle routing problem with multiple deliverymen

in this work we consider a variant of the vehicle routing problem that allows the assignment of multiple deliverymen to one or more routes. a practical motivation for this variant arises, for example, in the distribution of beverages in highly dense urban areas, characterized by the difficulty in serving daily requests within regular working day hours with a single deliveryman per vehicle. we present a mathematical model and a savings algorithm in order to generate low cost routes that maximize the number of requests served in compliance with the maximum route time. the impact of the extra deliverymen on the solutions provided by the proposed heuristic is assessed by means of sets of generated examples based on classical instances of literature. it is also presented the results obtained by an adaptation of a tabu search approach from the literature.