Consistent Inventory Routing with Split Deliveries

Emilio Jose Alarcon Ortega (), Michael Schilde, Karl F. Doerner and Sebastian Malicki
Additional contact information
Emilio Jose Alarcon Ortega: University of Vienna
Michael Schilde: University of Vienna
Karl F. Doerner: University of Vienna
Sebastian Malicki: Technical University of Munich

A chapter in Operations Research Proceedings 2017, 2018, pp 395-401 from Springer

Abstract: Abstract In this paper, we present a matheuristic solution technique to solve a real world problem related to the distribution and inventory management of beer from breweries to restaurants and bars. Consistency in delivery times is an important requirement for this application. Other problem characteristics are the possibility of split deliveries and the existence of time windows. Hence, the problem aims to minimize costs related to routing, consistency, inventory holding stock-out. We develop an adaptive large neighborhood search method and we propose different destroy and repair operators. The method is tested using a benchmark data set and compared to optimal solutions on small test instances.

Keywords: Inventory routing; Consistent routing; Adaptive large neighborhood search (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:oprchp:978-3-319-89920-6_53

Ordering information: This item can be ordered from
http://www.springer.com/9783319899206

DOI: 10.1007/978-3-319-89920-6_53

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().