QUEIROGA, Eduardo; SADYKOV, Ruslan; UCHOA, Eduardo

doi:10.1016/j.cor.2021.105475

Métadonnées

Licence d’utilisation du document

QUEIROGA, Eduardo
Universidade Federal Fluminense [Rio de Janeiro] [UFF]

SADYKOV, Ruslan
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Institut de Mathématiques de Bordeaux [IMB]

UCHOA, Eduardo
Universidade Federal Fluminense [Rio de Janeiro] [UFF]

Langue

Article de revue

Ce document a été publié dans

Computers and Operations Research. 2021-12, vol. 136, n° 105475

Elsevier

Résumé en anglais

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.< Réduire

Métadonnées

Partager cette publication !

Licence d’utilisation du document

A POPMUSIC matheuristic for the capacitated vehicle routing problem

Langue

Ce document a été publié dans

Résumé en anglais

URI

DOI

Origine

Unités de recherche