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 条
  • [21] Multi-depot rural postman problems
    Elena Fernández
    Jessica Rodríguez-Pereira
    TOP, 2017, 25 : 340 - 372
  • [22] Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems
    Gauthier, Jean Bertrand
    Irnich, Stefan
    DISCRETE APPLIED MATHEMATICS, 2024, 346 : 131 - 153
  • [23] The min-max multi-depot vehicle routing problem: heuristics and computational results
    Wang, Xingyin
    Golden, Bruce
    Wasil, Edward
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2015, 66 (09) : 1430 - 1441
  • [24] Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
    Rahma Lahyani
    Leandro C. Coelho
    Jacques Renaud
    OR Spectrum, 2018, 40 : 125 - 157
  • [25] Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
    Lahyani, Rahma
    Coelho, Leandro C.
    Renaud, Jacques
    OR SPECTRUM, 2018, 40 (01) : 125 - 157
  • [26] METAHEURISTIC APPROACH FOR THE MULTI-DEPOT VEHICLE ROUTING PROBLEM
    Geetha, S.
    Vanathi, P. T.
    Poonthalir, G.
    APPLIED ARTIFICIAL INTELLIGENCE, 2012, 26 (09) : 878 - 901
  • [27] The multi-depot vehicle routing problem with inter-depot routes
    Crevier, Benoit
    Cordeau, Jean-Francois
    Laporte, Gilbert
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 176 (02) : 756 - 773
  • [28] Selective multi-depot vehicle routing problem with pricing
    Aras, Necati
    Aksen, Deniz
    Tekin, Mehmet Tugrul
    TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2011, 19 (05) : 866 - 884
  • [29] A hybrid adaptive large neighbourhood search for multi-depot open vehicle routing problems
    Lahyani, Rahma
    Gouguenheim, Anne-Lise
    Coelho, Leandro C.
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2019, 57 (22) : 6963 - 6976
  • [30] VEHICLE ROUTING PROBLEM WITH MULTI-DEPOT AND MULTI-TASK
    Yang, Haoxiong
    Jing, Li
    Zhou, Yongsheng
    He, Mingke
    ICEIS 2011: PROCEEDINGS OF THE 13TH INTERNATIONAL CONFERENCE ON ENTERPRISE INFORMATION SYSTEMS, VOL 4, 2011, : 650 - 655
12345