A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking. (August 2017)

• Record Type: Journal Article
• Authors: Grangier, Philippe; Gendreau, Michel; Lehuédé, Fabien; Rousseau, Louis-Martin
• Is Part Of: Computers & operations research. Volume 84(2017)
• Page Start: 116
• Page End: 126
• Publication Date: 2017-08
• Subjects: Routing -- Cross-docking -- Transfers -- Synchronization -- Matheuristic; Operations research -- Periodicals; Electronic digital computers -- Periodicals; 004.05
• DOI: 10.1016/j.cor.2017.03.004
• Languages: English
• ISSNs: 0305-0548

Abstract

Highlights: a matheuristic based for the VRPCD is proposed. the method is based on large neighborhood search search and branch-and-check. this method improves many best known solutions. 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.