New lower bounds and exact method for the m-PVRP

This paper presents new lower bounding procedures and an exact method for the m-peripatetic vehicle routing problem (m-PVRP) based on polyhedral and column generation approaches. The branch-and-cut algorithms use three types of valid cuts on the edge-based formulation. The column-generation-based lower bounding procedure is applied on the dual set partitioning formulation and is composed of dual heuristics that estimate good dual variable values and therefore high lower bounds. Computational results on instances from the literature show that these new lower bounds reach on average 97.5% to 99% of the best known upper bounds and optimality is proven for a third of the instances