Implementation of an adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem

The cumulative capacitated vehicle problem is a transportation problem with the objective to minimize the sum of arrival times at customers, subject to vehicle constraints. This type of problem focuses on satisfying the need of customers, it plays on important role concerning humanitarian aid. The purpose of this research is to implement an adaptive large neighbourhood search heuristic for the cumulative capacitated vehicle routing problem by Ribeiro et al. The heuristic is implemented and tested on a varied set of benchmark problems. The removal and insertion heuristics that were based on randomness performed the best. However, the performance of the heuristics were dependent on the benchmark problems.