TY  - JOUR
U1  - Wissenschaftlicher Artikel
A1  - Cavaliere, Francesco
A1  - Bendotti, Emilio
A1  - Fischetti, Matteo
T1  - An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem
JF  - Mathematical Programming Computation
N2  - In this paper, an effective heuristic algorithm for large-scale instances of the Capacitated Vehicle Routing Problem is proposed. The technique consists in a local search method entangled with a restricted Set Partitioning problem optimization. Helsgaun’s LKH-3 algorithm has been used for the local search phase, with a number of implementation improvements. The restricted Set Partitioning formulation is solved by means of an exact commercial Integer Liner Programming solver. The resulting algorithm is able to consistently improve the solutions obtained by a state-of-the-art heuristic from the literature, as well as some of the best-know solutions maintained by the CVRPLIB website.
AB  - In this paper, an effective heuristic algorithm for large-scale instances of the Capacitated Vehicle Routing Problem is proposed. The technique consists in a local search method entangled with a restricted Set Partitioning problem optimization. Helsgaun’s LKH-3 algorithm has been used for the local search phase, with a number of implementation improvements. The restricted Set Partitioning formulation is solved by means of an exact commercial Integer Liner Programming solver. The resulting algorithm is able to consistently improve the solutions obtained by a state-of-the-art heuristic from the literature, as well as some of the best-know solutions maintained by the CVRPLIB website.
Y1  - 2022
SN  - 1867-2949
SS  - 1867-2949
U6  - https://doi.org/10.1007/s12532-022-00224-2
DO  - https://doi.org/10.1007/s12532-022-00224-2
VL  - 14
IS  - 4
SP  - 749
EP  - 779
S1  - 31
PB  - Springer Science and Business Media LLC
ER  -