The split delivery vehicle routing problem with time windows and customer inconvenience constraints

Publication type:
Journal article
Metadata:
Autoren
  • Nicola Bianchessi
  • Michael Drexl
  • Stefan Irnich
Sammlungen
  • metadata
ISSN
1526-5447
Ausgabe der Veröffentlichung
4
Zeitschrift
Transportation science
Schlüsselwörter
  • 330 Wirtschaft
  • 330 Economics
Sprache
eng
Paginierung
Seiten: 1067 - 1084
Datum der Veröffentlichung
2019
Herausgeber
INFORMS
Herausgeber URL
http://dx.doi.org/10.1287/trsc.2018.0862
Datum der Datenerfassung
2020
Datum, an dem der Datensatz öffentlich gemacht wurde
2020
Zugang
Public
Titel
The split delivery vehicle routing problem with time windows and customer inconvenience constraints
Ausgabe der Zeitschrift
53

Data source: METADATA.UB

Other metadata sources:
Autoren
  • Nicola Bianchessi
  • Michael Drexl
  • Stefan Irnich
Autoren-URL
https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=fis-test-1&SrcAuth=WosAPI&KeyUT=WOS:000476617800007&DestLinkType=FullRecord&DestApp=WOS_CPL
DOI
10.1287/trsc.2018.0862
Externe Identifier
  • Clarivate Analytics Document Solution ID: IK5IB
ISSN
0041-1655
Ausgabe der Veröffentlichung
4
Zeitschrift
TRANSPORTATION SCIENCE
Schlüsselwörter
  • split delivery vehicle routing problem
  • time windows
  • synchronization
  • maximum number of visits
  • branch-and-cut
Paginierung
1067 - 1084
Datum der Veröffentlichung
2019
Status
Published
Titel
The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints
Sub types
  • Article
Ausgabe der Zeitschrift
53

Data source: Web of Science (Lite)

Abstract
<jats:p> 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, and 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. </jats:p>
Autoren
  • Nicola Bianchessi
  • Michael Drexl
  • Stefan Irnich
DOI
10.1287/trsc.2018.0862
eISSN
1526-5447
ISSN
0041-1655
Ausgabe der Veröffentlichung
4
Zeitschrift
Transportation Science
Sprache
en
Paginierung
1067 - 1084
Datum der Veröffentlichung
2019
Status
Published
Herausgeber
Institute for Operations Research and the Management Sciences (INFORMS)
Herausgeber URL
http://dx.doi.org/10.1287/trsc.2018.0862
Datum der Datenerfassung
2023
Titel
The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints
Ausgabe der Zeitschrift
53

Data source: Crossref

Autoren
  • Nicola Bianchessi
  • Michael Drexl
  • Stefan Irnich
DOI
10.1287/trsc.2018.0862
Zeitschrift
Transp. Sci.
Artikelnummer
4
Paginierung
1067 - 1084
Datum der Veröffentlichung
2019
Titel
The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints.
Ausgabe der Zeitschrift
53

Data source: DBLP

Beziehungen:
Property of

Tools