Matheuristic search techniques for the consistent inventory routing problem with time windows and split deliveries

Emilio J. Alarcon Ortega, Michael Schilde and Karl F. Doerner

Operations Research Perspectives, 2020, vol. 7, issue C

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.

Keywords: Inventory routing problem; Adaptive large neighborhood search; Consistency; Matheuristics, (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S2214716020300427
Full text for ScienceDirect subscribers only

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:eee:oprepe:v:7:y:2020:i:c:s2214716020300427

DOI: 10.1016/j.orp.2020.100152

Access Statistics for this article

Operations Research Perspectives is currently edited by Rubén Ruiz Garcia

More articles in Operations Research Perspectives from Elsevier
Bibliographic data for series maintained by Catherine Liu ().