The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints
The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints
复制标题
DOI:
10.1287/trsc.2018.0862
复制
发表时间:
2019-05
期刊:
影响因子:
--
通讯作者:
Nicola Bianchessi;Michael Drexl;Stefan Irnich
中科院分区:
文献类型:
--
作者:
Nicola Bianchessi;Michael Drexl;Stefan Irnich
In classical routing problems, each customer is visited exactly once. By contrast, when allowing split deliveries, customers may be served through multiple visits. This potentially results in substantial savings in travel costs. Even if split deliveries are bene?cial to the transport company, several visits may be undesirable on the customer side: at each visit the customer has to interrupt his primary activities and handle the goods receipt. The contribution of the present paper consists in a thorough analysis of the possibilities and limitations of split delivery distribution strategies. To this end, we investigate two different types of measures for limiting customer inconvenience (a maximum number of visits and the temporal synchronization of deliveries) and evaluate the impact of these measures on carrier e?ciency by means of different objective functions (comprising variable routing costs, costs related to route durations, ?xed ?eet costs). We consider the vehicle routing problem with time windows in which split deliveries are allowed (SDVRPTW) and de?ne the corresponding generalization that takes into account customer inconvenience constraints (SDVRPTW-IC). We design an extended branch-and-cut algorithm to solve the SDVRPTW-IC and report on experimental results showing the impact of customer inconvenience constraints. We ?nally draw useful insights for logistics managers on the basis of the experimental analysis carried out.