|
Diskretnyi Analiz i Issledovanie Operatsii, 2024, Volume 31, Issue 4, Pages 186–212 DOI: https://doi.org/10.33048/daio.2024.31.794
(Mi da1367)
|
|
|
|
Decomposition approach for a two echelon inventory management system
A. D. Yuskova, I. N. Kulachenkob, A. A. Melnikovb, Yu. A. Kochetovb a Novosibirsk State University, 2 Pirogov Street, 630090 Novosibirsk, Russia
b Sobolev Institute of Mathematics, 4 Acad. Koptyug Avenue, 630090 Novosibrsk, Russia
DOI:
https://doi.org/10.33048/daio.2024.31.794
Abstract:
Warehouses of the first echelon in a two-echelon system are designed to satisfy customer orders. In the second echelon, we have a central warehouse for restocking the first echelon warehouses. Customer orders can be partially satisfied, but the total fraction of completed orders should not be less than the specified threshold. We need to minimize the total cost of storing the items in all warehouses. We use a deterministic simulation to calculate the order satisfaction ratio and the storage cost during the planning period. The simulation depends on inventory management policies at each warehouse for each type of items. We develop a decomposition method for solving the problem. It is based on solution of subproblems for each type of items. Also, we propose some approaches for exact solution of the problem. The results of numerical experiments with instances with 100 warehouses and 1000 types of items are presented. On instances with known exact solutions, we have the optimum in two cases, while in the other cases the deviation from the optimal values is at most 1.9%. Tab. 5, illustr. 1, bibliogr. 23.
Keywords:
gray-box optimization, knapsack problem, local search.
Received: 25.01.2024 Revised: 10.03.2024 Accepted: 22.06.2024
Citation:
A. D. Yuskov, I. N. Kulachenko, A. A. Melnikov, Yu. A. Kochetov, “Decomposition approach for a two echelon inventory management system”, Diskretn. Anal. Issled. Oper., 31:4 (2024), 186–212; J. Appl. Industr. Math., 18:4 (2024), 919–935
Linking options:
https://www.mathnet.ru/eng/da1367 https://www.mathnet.ru/eng/da/v31/i4/p186
|
| Statistics & downloads: |
| Abstract page: | 74 | | Full-text PDF : | 34 | | References: | 10 |
|