An iterated tabu search for the multi-compartment vehicle routing problem

We study a practical variant of the vehicle routing problem with compartments.We propose a heuristic solution using tabu search embedded in iterated local search.We report results of experiments which analyze the heuristic performance in detail.We find that the proposed approach dominates existing approaches in nearly all cases.We further find that allowing split demands have a limited effect. We study a variant of the vehicle routing problem that allows vehicles with multiple compartments. The need for multiple compartments frequently arises in practical applications when there are several products of different quality or type, that must be kept or handled separately. The resulting problem is called the multi-compartment vehicle routing problem (MCVRP). We propose a tabu search heuristic and embed it into a iterated local search to solve the MCVRP. In several experiments we analyze the performance of the iterated tabu search and compare it to results from the literature. We find that it consistently produces solutions that are better than existing heuristic algorithms.