The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints

Nicola Bianchessi (), Michael Drexl () and Stefan Irnich ()
Additional contact information
Nicola Bianchessi: Johannes Gutenberg University Mainz, University of Brescia
Michael Drexl: Johannes Gutenberg University Mainz, Deggendorf Institute of Technology
Stefan Irnich: Johannes Gutenberg University Mainz

No 1706, Working Papers from Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz

Abstract: 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.

Keywords: Split delivery vehicle routing problem; Time windows; Synchronization; Maximum number of visits; Branch-and-cut (search for similar items in EconPapers)
Pages: 35 pages
Date: 2017-04-04
New Economics Papers: this item is included in nep-cmp and nep-tre
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://download.uni-mainz.de/RePEc/pdf/Discussion_Paper_1706.pdf First version, 2017 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:jgu:wpaper:1706

Access Statistics for this paper

More papers in Working Papers from Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz Contact information at EDIRC.
Bibliographic data for series maintained by Research Unit IPP ().