Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location

Autor(en)

Briseida Sarasola, Karl Franz Dörner

Abstrakt

A vehicle routing problem with synchronization constraints arises in urban freight transportation, in which context customers require deliveries from one or more logistics service providers. These deliveries should be efficient to reduce idle times at the delivery locations. Idle time is defined as nonservice time between the first and the last delivery received by the customer. We propose a strategy which relies on self-imposed time windows, and we compare our approach with an exact determination of a feasible schedule and fixed time windows. The results show that idle times can be reduced by 54.12%-79.77%, with an average cost rise of 9.87%. In addition, self-imposed time windows provide solutions with 15.74%-21.43% lower costs than feasibility checks for short runtimes and 13.71%-21.15% lower than fixed time windows.

Organisation(en)

Institut für Business Decisions and Analytics, Institut für Rechnungswesen, Innovation und Strategie, Forschungsverbund Data Science

Journal

Networks (New York): an international journal

Band

75

Seiten

64-85

Anzahl der Seiten

22

ISSN

0028-3045

DOI

https://doi.org/10.1002/net.21905

Publikationsdatum

2018

Peer-reviewed

Ja

ÖFOS 2012

101015 Operations Research, 502017 Logistik

Schlagwörter

ASJC Scopus Sachgebiete

Software, Information systems, Hardware and Architecture, Computer Networks and Communications

Sustainable Development Goals

SDG 11 – Nachhaltige Städte und Gemeinden

Link zum Portal

https://ucris.univie.ac.at/portal/de/publications/adaptive-large-neighborhood-search-for-the-vehicle-routing-problem-with-synchronization-constraints-at-the-delivery-location(312e826e-7aa3-4154-bb4f-fb9bc8b24612).html