The consistent vehicle routing problem with service level agreements

A matheuristic for the consistent vehicle routing problem with service level agreements

This paper presents a mathematical model which tackles the Consistent Vehicle Routing Problem (conVRP) with multiple daily deliveries and distinct service level agreements, such as time windows, daily period specifications and order deadlines right before vehicle departure. In addition, an instance size reduction algorithm and a Fix and Optimize based matheuristic are proposed. A case study is presented in which total travelled distance is reduced by over 15% with an estimated impact of up to 12% of the influenceable monthly distribution cost.