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.
Type de document :
Article dans une revue
Computers and Operations Research, Elsevier, 2017, 84, pp.116 - 126. 〈10.1016/j.cor.2017.03.004〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01499170
Contributeur : Fabien Lehuédé <>
Soumis le : vendredi 31 mars 2017 - 05:18:16
Dernière modification le : mardi 10 octobre 2017 - 14:46:26

Identifiants

Collections

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〉

Partager

Métriques

Consultations de la notice

297