Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints

This paper provides a review of the recent developments that had a major impact on the current state-ofthe- art exact algorithms for the vehicle routing problem (VRP). The paper reviews mathematical formulations, relaxations and recent exact methods for two of the most important variants of the VRP: the capacitated VRP (CVRP) and the VRP with time windows (VRPTW). The paper also reports a comparison of the computational performances of the different exact algorithms for the CVRP and VRPTW.