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

被引:73
|
作者
Grangier, Philippe [1 ,2 ]
Gendreau, Michel [2 ]
Lehuede, Fabien [1 ]
Rousseau, Louis-Martin [2 ]
机构
[1] Ecole Mines Nantes, IRCCyN UMR CNRS 6597, LUNAM, 4 Rue Alfred Kastler, F-44307 Nantes 3, France
[2] Ecole Polytech Montreal, CIRRELT, Dept Math & Ind Engn, Montreal, PQ H3C 3A7, Canada
关键词
Routing; Cross-docking; Transfers; Synchronization; Matheuristic; DELIVERY PROBLEM; PICKUP; SYNCHRONIZATION;
D O I
10.1016/j.cor.2017.03.004
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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. (C) 2017 Elsevier Ltd. All rights reserved.
引用
收藏
页码:116 / 126
页数:11
相关论文
共 50 条
  • [11] The Vehicle Routing Problem with Cross-Docking and Scheduling at the Docking Station: Compact formulation and a General Variable Neighborhood Search metaheuristic
    Souza, Vitor A. A.
    Melo, Rafael A.
    Mateus, Geraldo R.
    APPLIED SOFT COMPUTING, 2024, 161
  • [12] Open vehicle routing problem with cross-docking
    Yu, Vincent F.
    Jewpanya, Parida
    Redi, A. A. N. Perwira
    COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 94 : 6 - 17
  • [13] Vehicle routing with cross-docking
    Wen, M.
    Larsen, J.
    Clausen, J.
    Cordeau, J-F
    Laporte, G.
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2009, 60 (12) : 1708 - 1718
  • [14] The vehicle routing problem with cross-docking and resource constraints
    Grangier, Philippe
    Gendreau, Michel
    Lehuede, Fabien
    Rousseau, Louis-Martin
    JOURNAL OF HEURISTICS, 2021, 27 (1-2) : 31 - 61
  • [15] The vehicle routing problem with cross-docking and resource constraints
    Philippe Grangier
    Michel Gendreau
    Fabien Lehuédé
    Louis-Martin Rousseau
    Journal of Heuristics, 2021, 27 : 31 - 61
  • [16] A New Large Neighborhood Search Based Matheuristic Framework for Rich Vehicle Routing Problems
    Mancini, Simona
    COMPUTER AIDED SYSTEMS THEORY - EUROCAST 2015, 2015, 9520 : 789 - 796
  • [17] Vehicle Routing Problem for Fashion Supply Chains with Cross-Docking
    Hu, Zhi-Hua
    Zhao, Yingxue
    Choi, Tsan-Ming
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2013, 2013
  • [18] A sweep-heuristic based formulation for the vehicle routing problem with cross-docking
    Dondo, Rodolfo
    Cerda, Jaime
    COMPUTERS & CHEMICAL ENGINEERING, 2013, 48 : 293 - 311
  • [19] Adaptive multi-restart Tabu Search algorithm for the vehicle routing problem with cross-docking
    Christos D. Tarantilis
    Optimization Letters, 2013, 7 : 1583 - 1596
  • [20] Adaptive multi-restart Tabu Search algorithm for the vehicle routing problem with cross-docking
    Tarantilis, Christos D.
    OPTIMIZATION LETTERS, 2013, 7 (07) : 1583 - 1596