Skip to main content

Consistent Inventory Routing with Split Deliveries

  • Conference paper
  • First Online:
Operations Research Proceedings 2017

Part of the book series: Operations Research Proceedings ((ORP))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Coelho, L. C., Cordeau, J. F., & Laporte, G. (2014). Thirty years of inventory routing. Transportation Science, 48(1), 1–19.

    Article  Google Scholar 

  2. Hemmelmayr, V., Doerner, K. F., Hartl, R. F., & Savelsbergh, M. W. P. (2009). Delivery strategies for blood products supplies. OR Spectrum: Quantitative Approaches in Management, 31(4), 707–725.

    Article  Google Scholar 

  3. Kovacs, A., Parragh, S. N., & Hartl, R. F. (2014). A template-based adaptive large neighborhood search for the consistent vehicle routing problem. Networks, 63(1), 60–81.

    Article  Google Scholar 

  4. Coelho, L. C., Cordeau, J. F., & Laporte, G. (2014). Consistency in multi-vehicle inventory-routing. Transportation Science, 24, 270–287.

    Google Scholar 

  5. Cordeau, J. F., Laporte, G., & Mercier, A. (2001). A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society, 52(8), 928–936.

    Article  Google Scholar 

  6. Archetti, C., Speranza, M. G., & Hertz, A. (2006). A tabu search algorithm for the split delivery vehicle routing problem. Transportation Science, 40(1), 64–73.

    Article  Google Scholar 

Download references

Acknowledgements

Financial support from the Austrian and German Science Fund (FWF and DFG, D-A-CH) under Grant I 2248-N32 is gratefully acknowledged.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Emilio Jose Alarcon Ortega .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Alarcon Ortega, E.J., Schilde, M., Doerner, K.F., Malicki, S. (2018). Consistent Inventory Routing with Split Deliveries. In: Kliewer, N., Ehmke, J., Borndörfer, R. (eds) Operations Research Proceedings 2017. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-89920-6_53

Download citation

Publish with us

Policies and ethics