Rich vehicle routing problem with last-mile outsourcing decisions

被引:36
作者
Alcaraz, Juan J. [1 ]
Caballero-Arnaldos, Luis [1 ]
Vales-Alonso, Javier [1 ]
机构
[1] Tech Univ Cartagena UPCT, Dept Informat & Commun Technol, Cartagena, Spain
关键词
Rich vehicle routing problems; Algorithms; Metaheuristics; VARIABLE NEIGHBORHOOD SEARCH; TABU SEARCH; TIME WINDOWS; OPTIMIZATION ALGORITHM; FLEET; FORMULATION; DISCRETE; OVERTIME;
D O I
10.1016/j.tre.2019.08.004
中图分类号
F [经济];
学科分类号
02 ;
摘要
This paper addresses a Rich Vehicle Routing Problem (RVRP) characterized by the following attributes: long-haul transport, driver hours regulation, incompatibility among goods, multiple depots and pickup locations, heterogeneous vehicles, time windows, and outsourcing decisions for last-mile delivery. Addressing the latter aspect is especially challenging, since it requires substantial changes in the algorithms for generating initial feasible solutions (construction heuristic) and for modifying existing solutions (improvement heuristics). Our work develops new heuristics adapted to the above attributes, and evaluates their performance in combination with common solving metaheuristics. We also assess the impact and the cost-effectiveness of the outsourcing attribute.
引用
收藏
页码:263 / 286
页数:24
相关论文
共 62 条
[51]   European Driver Rules in Vehicle Routing with Time Windows [J].
Prescott-Gagnon, Eric ;
Desaulniers, Guy ;
Drexl, Michael ;
Rousseau, Louis-Martin .
TRANSPORTATION SCIENCE, 2010, 44 (04) :455-473
[52]   A stochastic multi-period industrial hazardous waste location-routing problem: Integrating NSGA-II and Monte Carlo simulation [J].
Rabbani, M. ;
Heidari, R. ;
Yazdanparast, R. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 272 (03) :945-961
[53]   The heterogeneous fleet vehicle routing problem with light loads and overtime: Formulation and population variable neighbourhood search with adaptive memory [J].
Simeonova, Lina ;
Wassan, Niaz ;
Salhi, Said ;
Nagy, Gabor .
EXPERT SYSTEMS WITH APPLICATIONS, 2018, 114 :183-195
[54]   ALGORITHMS FOR THE VEHICLE-ROUTING AND SCHEDULING PROBLEMS WITH TIME WINDOW CONSTRAINTS [J].
SOLOMON, MM .
OPERATIONS RESEARCH, 1987, 35 (02) :254-265
[55]   An Adaptive Variable Neighborhood Search Algorithm for a Vehicle Routing Problem Arising in Small Package Shipping [J].
Stenger, Andreas ;
Vigo, Daniele ;
Enz, Steffen ;
Schwind, Michael .
TRANSPORTATION SCIENCE, 2013, 47 (01) :64-80
[56]   A hybrid algorithm for a class of vehicle routing problems [J].
Subramanian, Anand ;
Uchoa, Eduardo ;
Ochi, Luiz Satoru .
COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (10) :2519-2531
[57]   The granular tabu search and its application to the vehicle-routing problem [J].
Toth, P ;
Vigo, D .
INFORMS JOURNAL ON COMPUTING, 2003, 15 (04) :333-346
[58]   New benchmark instances for the Capacitated Vehicle Routing Problem [J].
Uchoa, Eduardo ;
Pecin, Diego ;
Pessoa, Artur ;
Poggi, Marcus ;
Vidal, Thibaut ;
Subramanian, Anand .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 257 (03) :845-858
[59]   Heuristics for multi-attribute vehicle routing problems: A survey and synthesis [J].
Vidal, Thibaut ;
Crainic, Teodor Gabriel ;
Gendreau, Michel ;
Prins, Christian .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 231 (01) :1-21
[60]   The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement [J].
Wang, Xingyin ;
Golden, Bruce ;
Wasil, Edward ;
Zhang, Rui .
COMPUTERS & OPERATIONS RESEARCH, 2016, 71 :110-126