Daniele Vigo ( University of Bologna)


Solution approaches for vehicle routing problems


The Vehicle Routing Problem (VRP) and its variants form one of the most studied families of combinatorial optimization problems. This is not only due to their practical relevance but also to the notorious difficulty that made them a challenging benchmark for all new solution approaches. The aim of this lecture is to review the main exact and heuristic approaches proposed for the solution of some important problems in the VRP family.