A case study of Consistent Vehicle Routing Problem with Time Windows
We develop a heuristic solution method for the Consistent Vehicle Routing Problem with Time Windows (ConVRPTW), motivated by a real-world application at a distribution center of a food company. Additional to standard VRPTW restrictions, ConVRP assigns to each customer just one fixed driver to fulfill their orders during the complete multi-period planning horizon. For each driver and day of the planning horizon, a route has to be determined to serve all their assigned customers with positive demand. The customers do not buy every day and the frequency with which they do so is irregular. Moreover, the quantities ordered change from one order to another. This causes difficulties in the daily routing, negatively impacting the service level of the company. Unlike the previous works on ConVRP, where the number of drivers is fixed a priori and only the total travel time is minimized, we give priority to minimizing the number of drivers. To evaluate the performance of the heuristic, we compare the solution of the heuristic with the routing plan in use by the food company. The results show significant improvements, with a lower number of trucks and a higher rate of orders delivered within the prescribed time window.
READ FULL TEXT