Cumulative VRP with Time Windows: A Trade-Off Analysis

Abstract

In this work, the Cumulative Vehicle Routing Problem (CumVRP) is studied. It is a routing optimization problem, in which the objective is to construct a set of vehicle routes with the minimum cumulative cost in terms of distance and weight over a traveled arc. The CumVRP can be defined with hard and soft time windows constraints for incorporating customer service. To tackle this problem, a matheuristic approach based on combining mathematical programming and an iterative metaheuristic algorithm Greedy Randomized Adaptive Search Procedure (GRASP) is proposed. In each step of our approach, a feasible solution (set of routes) is built using GRASP, and, afterward, the solution is optimized using a MILP optimizer. The main objective of this research is to analyze the trade-off between the environmental cost produced by the delivery of goods complying with the limits of time windows and the customer’s dissatisfaction when these limits are violated at a certain time limit previously defined. The results show that the environmental cost is reduced if the violation of the upper limits of the customers’ time windows is allowed. These violations generate a cost associated with penalties that are well balanced with respect to the reduction of emissions.