Titel
Matheuristic search techniques for the consistent inventory routing problem with time windows and split deliveries
Autor*in
Abstract
This article introduces a new variant of the inventory routing problem related to real-world businesses. Specifically, in the beverage industry, business customers such as restaurants and bars, demand consistent delivery times, have different opening times and delivery time windows, and occasionally, due to special events, exhibit demands that exceed single-vehicle capacity leading to the need of splitting demands between several vehicles. We present two variants of a mathematical formulation that include all the characteristics of this inventory routing problem. In the first, we apply the maximum level policy, whereas in the second variant, we apply an order-up-to-level policy. As a solution technique, we propose a matheuristic based on an adaptive large neighborhood search algorithm for which we developed several destroy and repair operators specifically designed to address the special problem features. Extensive computational tests based on artificial and real-world instances affirm the efficiency of the solution approach. Furthermore, we analyze the solution quality, the impact of the characteristics and policies applied, and the practicability for the real world.
Stichwort
Inventory routing problemAdaptive large neighborhood searchConsistencyMatheuristics
Objekt-Typ
Sprache
Englisch [eng]
Persistent identifier
Erschienen in
Titel
Operations Research Perspectives
Band
7
ISSN
2214-7160
Erscheinungsdatum
2020
Publication
Elsevier BV
Projekt
Kod / Identifikator
I 2248-N32
Fördergeber
Erscheinungsdatum
2020
Zugänglichkeit
Rechteangabe
© 2020 Published by Elsevier Ltd
Universität Wien | Universitätsring 1 | 1010 Wien | T
+43-1-4277-0