Vehicle routing with backhauls: Review and research perspectives

被引:74
|
作者
Koc, Cagri [1 ]
Laporte, Gilbert [2 ,3 ]
机构
[1] Social Sci Univ Ankara, Dept Management, Ankara, Turkey
[2] Canada Res Chair Distribut Management, CIRRELT, Montreal, PQ, Canada
[3] HEC Montreal, Montreal, PQ, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Vehicle routing; Backhauls; Survey; Research directions; LOCAL SEARCH ALGORITHM; REACTIVE TABU SEARCH; HETEROGENEOUS FLEET; TIME WINDOWS; DELIVERIES; SINGLE; DEPOT; MATHEURISTICS; OPTIMIZATION; FORMULATION;
D O I
10.1016/j.cor.2017.11.003
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In the Vehicle Routing Problem with Backhauls (VRPB), the customer set is partitioned into linehaul customers who require deliveries, and backhaul customers who require pickups. Both the linehaul customers and the backhaul customers must be visited contiguously, and all routes must contain at least one line haul customer. All deliveries have to be loaded at the depot, and all pickups up have to be transported to the depot. This survey paper aims to comprehensively review the existing literature on VRPBs, including models, exact and heuristic algorithms, variants, industrial applications and case studies, with an emphasis on the recent literature. The paper contains several synthetic tables and proposes a number of promising research directions. (C) 2017 Elsevier Ltd. All rights reserved.
引用
收藏
页码:79 / 91
页数:13
相关论文
共 50 条