The last-mile vehicle routing problem with delivery options

Publication type:
Journal article
Metadata:
Autoren
  • Christian Tilk
  • Katharina Olkis
  • Stefan Irnich
Autoren-URL
https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=fis-test-1&SrcAuth=WosAPI&KeyUT=WOS:000664570600001&DestLinkType=FullRecord&DestApp=WOS_CPL
DOI
10.1007/s00291-021-00633-0
eISSN
1436-6304
Externe Identifier
  • Clarivate Analytics Document Solution ID: WO6UZ
ISSN
0171-6468
Ausgabe der Veröffentlichung
4
Zeitschrift
OR SPECTRUM
Schlüsselwörter
  • Routing
  • Vehicle routing
  • City logistics
  • Branch-price-and-cut
  • Service level
Paginierung
877 - 904
Datum der Veröffentlichung
2021
Status
Published
Titel
The last-mile vehicle routing problem with delivery options
Sub types
  • Article
Ausgabe der Zeitschrift
43

Data source: Web of Science (Lite)

Other metadata sources:
Abstract
<jats:title>Abstract</jats:title><jats:p>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.</jats:p>
Autoren
  • Christian Tilk
  • Katharina Olkis
  • Stefan Irnich
DOI
10.1007/s00291-021-00633-0
eISSN
1436-6304
ISSN
0171-6468
Ausgabe der Veröffentlichung
4
Zeitschrift
OR Spectrum
Sprache
en
Online publication date
2021
Paginierung
877 - 904
Datum der Veröffentlichung
2021
Status
Published
Herausgeber
Springer Science and Business Media LLC
Herausgeber URL
http://dx.doi.org/10.1007/s00291-021-00633-0
Datum der Datenerfassung
2023
Titel
The last-mile vehicle routing problem with delivery options
Ausgabe der Zeitschrift
43

Data source: Crossref

Autoren
  • Christian Tilk
  • Katharina Olkis
  • Stefan Irnich
Zeitschrift
OR Spectr.
Artikelnummer
4
Paginierung
877 - 904
Datum der Veröffentlichung
2021
Titel
The last-mile vehicle routing problem with delivery options.
Ausgabe der Zeitschrift
43

Data source: DBLP

Author's licence
CC-BY
Autoren
  • Christian Tilk
  • Katharina Olkis
  • Stefan Irnich
Hosting institution
Universitätsbibliothek Mainz
Sammlungen
  • JGU-Publikationen
Resource version
Published version
DOI
10.1007/s00291-021-00633-0
File(s) embargoed
false
Open access
true
ISSN
1436-6304
Zeitschrift
OR spectrum
Schlüsselwörter
  • 330 Wirtschaft
  • 330 Economics
  • 650 Management
  • 650 Management and auxiliary services
Sprache
eng
Open access status
Open Access
Paginierung
877 - 904
Datum der Veröffentlichung
2021
Public URL
https://openscience.ub.uni-mainz.de/handle/20.500.12030/7233
Herausgeber
Springer
Datum der Datenerfassung
2022
Datum, an dem der Datensatz öffentlich gemacht wurde
2022
Zugang
Public
Titel
The last-mile vehicle routing problem with delivery options
Ausgabe der Zeitschrift
43

Files

the_lastmile_vehicle_routing_-20220624143541194.pdf

Data source: OPENSCIENCE.UB

Beziehungen:
Property of

Tools