The last-mile vehicle routing problem with delivery options
Christian Tilk (),
Katharina Olkis () and
Stefan Irnich ()
Additional contact information
Christian Tilk: Johannes Gutenberg University Mainz
Katharina Olkis: Johannes Gutenberg University Mainz
Stefan Irnich: Johannes Gutenberg University Mainz
OR Spectrum: Quantitative Approaches in Management, 2021, vol. 43, issue 4, No 2, 877-904
Abstract:
Abstract The ongoing rise in e-commerce comes along with an increasing number of first-time delivery failures due to the absence of the customer at the delivery location. Failed deliveries result in rework which in turn has a large impact on the carriers’ delivery cost. In the classical vehicle routing problem (VRP) with time windows, each customer request has only one location and one time window describing where and when shipments need to be delivered. In contrast, we introduce and analyze the vehicle routing problem with delivery options (VRPDO), in which some requests can be shipped to alternative locations with possibly different time windows. Furthermore, customers may prefer some delivery options. The carrier must then select, for each request, one delivery option such that the carriers’ overall cost is minimized and a given service level regarding customer preferences is achieved. Moreover, when delivery options share a common location, e.g., a locker, capacities must be respected when assigning shipments. To solve the VRPDO exactly, we present a new branch-price-and-cut algorithm. The associated pricing subproblem is a shortest-path problem with resource constraints that we solve with a bidirectional labeling algorithm on an auxiliary network. We focus on the comparison of two alternative modeling approaches for the auxiliary network and present optimal solutions for instances with up to 100 delivery options. Moreover, we provide 17 new optimal solutions for the benchmark set for the VRP with roaming delivery locations.
Keywords: Routing; Vehicle routing; City logistics; Branch-price-and-cut; Service level (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)
Downloads: (external link)
http://link.springer.com/10.1007/s00291-021-00633-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
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:spr:orspec:v:43:y:2021:i:4:d:10.1007_s00291-021-00633-0
Ordering information: This journal article can be ordered from
http://www.springer. ... research/journal/291
DOI: 10.1007/s00291-021-00633-0
Access Statistics for this article
OR Spectrum: Quantitative Approaches in Management is currently edited by Rainer Kolisch
More articles in OR Spectrum: Quantitative Approaches in Management from Springer, Gesellschaft für Operations Research e.V.
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().