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

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01499170
Contributor : Fabien Lehuédé <>
Submitted on : Friday, March 31, 2017 - 5:18:16 AM
Last modification on : Tuesday, September 17, 2019 - 4:20:06 PM

Identifiers

Citation

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, Elsevier, 2017, 84, pp.116 - 126. ⟨10.1016/j.cor.2017.03.004⟩. ⟨hal-01499170⟩

Share

Metrics

Record views

519