Carlos Neves, Federal University of Paraíba

Abstract

The Vehicle Routing Problem with Time Windows is a more constrained version of the well-known Capacitated Vehicle Routing Problem which imposes constraints at the arrival time of the vehicles at each customer, in addition to the capacity constraints. As such, it is considered a harder variant of the CVRP. This paper describes a matheuristic algorithm for the VRPTW. The algorithm combines the Iterated Local Search metaheuristic with an exact method based on the set partitioning formulation for VRPs. In addition, we implemented several acceleration structures from the literature to improve its performance. Although the method has yet to be thoroughly tested and calibrated, it is promising, as our team got 5th place among all competitors in Phase 1, making it to the Phase 2.

[Challenge Paper]   [Video]