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 条
  • [21] Vehicle routing scheduling for cross-docking in the supply chain
    Lee, Young Hae
    Jung, Jung Woo
    Lee, Kyong Min
    COMPUTERS & INDUSTRIAL ENGINEERING, 2006, 51 (02) : 247 - 256
  • [22] Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints
    Hojabri, Hossein
    Gendreau, Michel
    Potvin, Jean-Yves
    Rousseau, Louis-Martin
    COMPUTERS & OPERATIONS RESEARCH, 2018, 92 : 87 - 97
  • [23] A hybrid meta-heuristic algorithm for vehicle routing and packing problem with cross-docking
    İlker Küçükoğlu
    Nursel Öztürk
    Journal of Intelligent Manufacturing, 2019, 30 : 2927 - 2943
  • [24] A hybrid meta-heuristic algorithm for vehicle routing and packing problem with cross-docking
    Kucukoglu, Ilker
    Ozturk, Nursel
    JOURNAL OF INTELLIGENT MANUFACTURING, 2019, 30 (08) : 2927 - 2943
  • [25] A Template-Based Adaptive Large Neighborhood Search for the Consistent Vehicle Routing Problem
    Kovacs, Attila A.
    Parragh, Sophie N.
    Hartl, Richard F.
    Parragh, Sophie N.
    NETWORKS, 2014, 63 (01) : 60 - 81
  • [26] A Large Neighborhood Search for the Vehicle Routing Problem with Multiple Time Windows
    Schaap, Hendrik
    Schiffer, Maximilian
    Schneider, Michael
    Walther, Grit
    TRANSPORTATION SCIENCE, 2022, : 1369 - 1392
  • [27] An adaptive large neighborhood search metaheuristic for the vehicle routing problem with drones
    Sacramento, David
    Pisinger, David
    Ropke, Stefan
    TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2019, 102 : 289 - 315
  • [28] A large neighborhood search approach to the vehicle routing problem with delivery options
    Dumez, Dorian
    Lehuede, Fabien
    Peton, Olivier
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2021, 144 : 103 - 132
  • [29] Vehicle routing problem in a kanban controlled supply chain system considering cross-docking strategy
    Asefeh Hasani Goodarzi
    Seyed Hessameddin Zegordi
    Operational Research, 2020, 20 : 2397 - 2425
  • [30] A new bi-objective vehicle routing-scheduling problem with cross-docking: Mathematical model and algorithms
    Goodarzi, Asefeh Hasani
    Tavakkoli-Moghaddam, Reza
    Amini, Alireza
    COMPUTERS & INDUSTRIAL ENGINEERING, 2020, 149
12345