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

被引：74
|
作者：
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
来源：
COMPUTERS & OPERATIONS RESEARCH | 2017年 / 84卷
关键词：
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] Modified variable neighborhood search and genetic algorithm for profitable heterogeneous vehicle routing problem with cross-docking
    Baniamerian, Ali
    Bashiri, Mahdi
    Tavakkoli-Moghaddam, Reza
    APPLIED SOFT COMPUTING, 2019, 75 : 441 - 460
  • [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] Adaptive multi-restart Tabu Search algorithm for the vehicle routing problem with cross-docking
    Christos D. Tarantilis
    Optimization Letters, 2013, 7 : 1583 - 1596
  • [15] A sweep-heuristic based formulation for the vehicle routing problem with cross-docking
    Dondo, Rodolfo
    Cerda, Jaime
    COMPUTERS & CHEMICAL ENGINEERING, 2013, 48 : 293 - 311
  • [16] Adaptive multi-restart Tabu Search algorithm for the vehicle routing problem with cross-docking
    Tarantilis, Christos D.
    OPTIMIZATION LETTERS, 2013, 7 (07) : 1583 - 1596
  • [17] Vehicle routing with cross-docking in the supply chain
    Liao, Ching-Jong
    Lin, Yaoming
    Shih, Stephen C.
    EXPERT SYSTEMS WITH APPLICATIONS, 2010, 37 (10) : 6868 - 6873
  • [18] A multi-tiered vehicle routing problem with global cross-docking
    Smith, A.
    Toth, P.
    Bam, L.
    van Vuuren, J. H.
    COMPUTERS & OPERATIONS RESEARCH, 2022, 137
  • [19] Adaptive memory programming for the many-to-many vehicle routing problem with cross-docking
    Nikolopoulou, Amalia I.
    Repoussis, Panagiotis P.
    Tarantilis, Christos D.
    Zachariadis, Emmanouil E.
    OPERATIONAL RESEARCH, 2019, 19 (01) : 1 - 38
  • [20] An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
    Grangier, Philippe
    Gendreau, Michel
    Lehuede, Fabien
    Rousseau, Louis-Martin
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 254 (01) : 80 - 91
12345