Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

A modern POPMUSIC matheuristic for the capacitated vehicle routing problem

Eduardo Queiroga 1 Ruslan Sadykov 2, 3 Eduardo Uchoa 1
2 Realopt - Reformulations based algorithms for Combinatorial Optimization
LaBRI - Laboratoire Bordelais de Recherche en Informatique, IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Abstract : 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.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [38 references]  Display  Hide  Download
Contributor : Ruslan Sadykov Connect in order to contact the contributor
Submitted on : Saturday, November 7, 2020 - 2:09:37 PM
Last modification on : Saturday, December 4, 2021 - 3:43:58 AM
Long-term archiving on: : Monday, February 8, 2021 - 6:47:59 PM


Files produced by the author(s)


  • HAL Id : hal-02994210, version 1



Eduardo Queiroga, Ruslan Sadykov, Eduardo Uchoa. A modern POPMUSIC matheuristic for the capacitated vehicle routing problem. 2020. ⟨hal-02994210⟩



Record views


Files downloads