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 beneficial 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 efficiency by means of different objective functions (comprising variable routing costs, costs related to route durations, fixed fleet costs). We consider the vehicle routing problem with time windows in which split deliveries are allowed (SDVRPTW) and define 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 finally draw useful insights for logistics managers on the basis of the experimental analysis carried out.
|Titolo:||The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints|
|Parole Chiave:||Split delivery vehicle routing problem; Time windows; Synchronization; Maximum number of visits; Branch-and-cut|
|Settore Scientifico Disciplinare:||Settore MAT/09 - Ricerca Operativa|
|Data di pubblicazione:||2019|
|Data ahead of print / Data di stampa:||19-mar-2019|
|Digital Object Identifier (DOI):||10.1287/trsc.2018.0862|
|Appare nelle tipologie:||01 - Articolo su periodico|