Analysis of effective sets of routes for the split-delivery periodic inventory routing problem
| Autor: | Demetrio Laganà, Geoffrey A. Chua, Rosario Paradiso, Luca Bertazzi |
|---|---|
| Přispěvatelé: | Operations Analytics |
| Jazyk: | angličtina |
| Rok vydání: | 2022 |
| Předmět: |
Inventory routing problem
Mathematical optimization Information Systems and Management General Computer Science Computer science 0211 other engineering and technologies Tactical planning Transportation 02 engineering and technology Management Science and Operations Research Industrial and Manufacturing Engineering Inventory level Matheuristics Split delivery 0502 economics and business Inventory routing 050210 logistics & transportation Class (computer programming) 021103 operations research 05 social sciences Decision variables Flow (mathematics) Modeling and Simulation Worst-case analysis Constant (mathematics) |
| Zdroj: | Bertazzi, L, Chua, G A, Laganà, D & Paradiso, R 2022, ' Analysis of effective sets of routes for the split-delivery periodic inventory routing problem ', European Journal of Operational Research, vol. 298, no. 2, pp. 463-477 . https://doi.org/10.1016/j.ejor.2021.05.029 European Journal of Operational Research, 298(2), 463-477. Elsevier |
| ISSN: | 0377-2217 |
| DOI: | 10.1016/j.ejor.2021.05.029 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect