Analysis of effective sets of routes for the split-delivery periodic inventory routing problem

Luca Bertazzi, Geoffrey A. Chua, Demetrio Laganà, Rosario Paradiso*

*Corresponding author for this work

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

We study an Inventory Routing Problem at the tactical planning level, where the initial inventory levels at the supplier and at the customers are decision variables and not given data. Since the total inventory level is constant over time, the final inventory levels are equal to the initial ones, making this problem periodic. We propose a class of matheuristics, in which a route-based formulation of the problem is solved to optimality with a given subset of routes. Our goal is to show how to design effective subsets of routes. For some of them, we prove effectiveness in the worst case, i.e., we provide a finite worst-case performance bound for the corresponding matheuristic. Moreover, we show they are also effective on average, in a large set of instances, when some additional routes are added to this subset of routes. These solutions significantly dominate, both in terms of cost and computational time, the best solutions obtained by applying a branch-and-cut algorithm we design to solve a flow–based formulation of the problem.

Original languageEnglish
Pages (from-to)463-477
JournalEuropean Journal of Operational Research
Volume298
Issue number2
DOIs
Publication statusPublished - 2022

Bibliographical note

Funding Information:
This research was supported in part by Singapore Ministry of Education Academic Research Fund MOE2015-T2-2-046 . The authors wish to thank the review team whose comments led to an improved version of this paper.

Publisher Copyright:
© 2021 The Authors

Copyright:
Copyright 2021 Elsevier B.V., All rights reserved.

Keywords

  • Inventory routing
  • Matheuristics
  • Split delivery
  • Transportation
  • Worst-case analysis

Fingerprint

Dive into the research topics of 'Analysis of effective sets of routes for the split-delivery periodic inventory routing problem'. Together they form a unique fingerprint.

Cite this