A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Computers and Operations Research Année : 2017

A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking

Résumé

The vehicle routing problem with cross-docking (VRPCD) consists in defining a set of routes that satisfy transportation requests between a set of pickup points and a set of delivery points. The vehicles bring goods from pickup locations to a cross-docking platform, where the items may be consolidated for efficient delivery. In this paper we propose a new solution methodology for this problem. It is based on large neighborhood search and periodically solving a set partitioning and matching problem with third-party solvers. Our method improves the best known solution in 19 of 35 instances from the literature.
Fichier non déposé

Dates et versions

hal-01499170 , version 1 (31-03-2017)

Identifiants

Citer

Philippe Grangier, Michel Gendreau, Fabien Lehuédé, Louis-Martin Rousseau. A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking. Computers and Operations Research, 2017, 84, pp.116 - 126. ⟨10.1016/j.cor.2017.03.004⟩. ⟨hal-01499170⟩
240 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More