QUEIROGA, Eduardo; SADYKOV, Ruslan; UCHOA, Eduardo

doi:10.1016/j.cor.2021.105475

Metadatos

Licencia de uso del documento

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]

Idioma

Article de revue

Este ítem está publicado en

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

Elsevier

Resumen en inglés

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.< Leer menos

Metadatos

Compartir este ítem

Licencia de uso del documento

A POPMUSIC matheuristic for the capacitated vehicle routing problem

Idioma

Este ítem está publicado en

Resumen en inglés

URI

DOI

Orígen

Centros de investigación