A modern POPMUSIC matheuristic for the capacitated vehicle routing problem

This work proposes a partial optimization metaheuristic under special intensification conditions (POPMUSIC) for the classical capacitated vehicle routing problem (CVRP). The proposed approach uses a branch-cut-and-price algorithm as a powerful heuristic to solve subproblems whose dimensions are typically between 25 and 200 customers. The whole algorithm can be seen as the application of local search over very large neighborhoods, starting from a single initial solution. The main computational experiments were carried out on instances having between 302 and 1000 customers. Using initial solutions generated by some of the best available metaheuristics for the problem, POPMUSIC was able to obtain consistently better solutions for long runs of up to 32 hours. In a final experiment, starting from the best known solutions available in CVRP library (CVRPLIB), POPMUSIC was able to find new best solutions for several instances, including some very large ones.

Citation

@techreport{QueirogaEtAl2020, Author = {Eduardo Queiroga and Ruslan Sadykov and Eduardo Uchoa}, Title = {A modern POPMUSIC matheuristic for the capacitated vehicle routing problem}, Institution = {Cadernos do LOGIS-UFF}, Address = {Niter{\'o}i, Brazil}, Number = {L-2020-2}, pages = {28}, month = {November}, Year = {2020} }

Article

Download

View A modern POPMUSIC matheuristic for the capacitated vehicle routing problem