GPU implementation of the multi depot Vehicle Routing Problem

We present a parallel implementations on GPU of an heuristic for solving the Vehicle Routing Problem (VRP) with single and with multi depot. To our knowledge, this is the first GPU implementation of such class of heuristics. Our solution for the classical VRP computes in parallel an initial solution (tours) and then iteratively it improves the costs of all pairs of neighbor tours. The multi depot case is solved by decomposing the problem in several independent basic VRP that we solve in parallel. Obtained experimental results under CUDA show that the proposed implementations exploit efficiently the parallelism and the power of the GPU.