A matheuristic for the joint replenishment problem with and without resource constraints

Milad Elyasi (), Ali Ekici, Başak Altan and Okan Örsan Özener
Additional contact information
Milad Elyasi: Ozyegin University
Ali Ekici: Ozyegin University
Başak Altan: Ozyegin University
Okan Örsan Özener: Ozyegin University

Annals of Operations Research, 2025, vol. 351, issue 1, No 27, 727-749

Abstract: Abstract We study the Joint Replenishment Problem (JRP), which arises from the need for coordinating the replenishment of multiple items that share a common fixed cost. Even in the basic setting, determining the optimal replenishment plan is an NP-Hard problem. We analyze both the JRP under indirect grouping policy and its variant with restrictions like transportation capacity, budget capacity, and item transportation compatibility. Additionally, we consider uncertainty characteristics such as imperfect item quality, as highlighted in related literature studies. We propose a novel matheuristic method that determines the best basic cycle time while addressing the problem with a fixed cycle time using a linear integer model. The proposed method is quite versatile to handle additional real-life constraints effectively. Based on an extensive computational study, we conclude that for the basic setting under indirect grouping policy, the proposed algorithm outperforms the benchmark algorithms in the literature by 0.3% on average. For more complicated settings with additional restrictions, our proposed algorithm outperforms the benchmark algorithm by around 5% on average.

Keywords: Inventory; Joint replenishment problem; Matheuristic; Simulated annealing; Transportation capacity (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-024-06230-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:annopr:v:351:y:2025:i:1:d:10.1007_s10479-024-06230-y

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-024-06230-y

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

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