Compact formulations for multi-depot routing problems: Theoretical and computational comparisons

被引：10

作者：

Bektas, Tolga ^{[1
]}

Gouveia, Luis ^{[2
]}

Santos, Daniel ^{[2
,3
]}

机构：

[1] Univ Liverpool, Management Sch, Chatham St, Liverpool L69 7ZH, Merseyside, England

[2] Univ Lisbon, Fac Ciencias, Ctr Matemat Aplicacoes Fundamentais & Invest Oper, C6 Piso 4, P-1749016 Lisbon, Portugal

[3] Univ Lisbon, Ctr Estudos Gestao, Inst Super Tecn, Av Rovisco Pais 1, P-1049001 Lisbon, Portugal

来源：

COMPUTERS & OPERATIONS RESEARCH | 2020年 / 124卷

关键词：

Vehicle routing; Multi-depot; Location-routing; Integer linear programming;

D O I：

10.1016/j.cor.2020.105084

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

Multi-depot routing problems mainly arise in distribution logistics where a fleet of vehicles are used to serve clients from a number of (potential) depots. The problem concerns deciding on the routes of each vehicle and the depots from which the vehicles depart, so as to minimize the total cost of travel. This paper reviews a number of existing compact formulations, and proposes new ones, for two types of multi-depot routing problems, one that includes the depot selection decisions, and the other where depots are pre-selected. The formulations are compared theoretically in terms of the strength of their linear programming relaxation, and computationally in terms of the running time needed to solve the instances to optimality. (c) 2020 Elsevier Ltd. All rights reserved.

引用

页数：15

共 50 条

[41] A tabu search heuristic for the multi-depot vehicle routing problem
Renaud, J
Laporte, G
Boctor, FF
COMPUTERS & OPERATIONS RESEARCH, 1996, 23 (03) : 229 - 235
[42] An improved formulation for the multi-depot open vehicle routing problem
Lalla-Ruiz, Eduardo
Exposito-Izquierdo, Christopher
Taheripour, Shervin
Voss, Stefan
OR SPECTRUM, 2016, 38 (01) : 175 - 187
[43] The multi-depot split delivery vehicle routing problem: An integer programming-based heuristic, new test problems, and computational results
Gulczynski, Damon
Golden, Bruce
Wasil, Edward
COMPUTERS & INDUSTRIAL ENGINEERING, 2011, 61 (03) : 794 - 804
[44] A biased-randomized variable neighborhood search for sustainable multi-depot vehicle routing problems
Reyes-Rubiano, Lorena
Calvet, Laura
Juan, Angel A.
Faulin, Javier
Bove, Lluc
JOURNAL OF HEURISTICS, 2020, 26 (03) : 401 - 422
[45] Graph attention reinforcement learning with flexible matching policies for multi-depot vehicle routing problems
Zhang, Ke
Lin, Xi
Li, Meng
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2023, 611
[46] An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems
Sadati, Mir Ehsan Hesam
Catay, Bulent
Aksen, Deniz
COMPUTERS & OPERATIONS RESEARCH, 2021, 133
[47] A Heuristic Solution Method for Multi-Depot Vehicle Routing-Based Waste Collection Problems
Shi, Yanjun
Lv, Lingling
Hu, Fanyi
Han, Qiaomei
APPLIED SCIENCES-BASEL, 2020, 10 (07):
[48] A Multi-Depot Logistics Distribution Routing Model for Unexpected Events
Huang, Xiaoxia
Song, Liying
Song, Hongqing
2017 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING, MANAGEMENT SCIENCE AND APPLICATION (ICIMSA 2017), 2017, : 166 - 170
[49] Multi-depot vessel routing problem in a direction dependent wavefield
Michael J. Hirsch
Daniel E. Schroeder
Alvaro Maggiar
Irina S. Dolinskaya
Journal of Combinatorial Optimization, 2014, 28 : 38 - 57
[50] Multi-depot vehicle routing problem with drones in emergency logistics
Weng, Xun
She, Wenke
Fan, Hongqiang
Zhang, Jingtian
Yun, Lifen
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2025, 28 (01):

← 1 2 3 4 5 →