A. D. Yuskov, I. N. Kulachenko, A. A. Melnikov, Yu. A. Kochetov
{"title":"双层库存管理系统的分解方法","authors":"A. D. Yuskov, I. N. Kulachenko, A. A. Melnikov, Yu. A. Kochetov","doi":"10.1134/S1990478924040239","DOIUrl":null,"url":null,"abstract":"<p> Warehouses of the first echelon in a two-echelon system are designed to satisfy customer\norders. In the second echelon, we have a central warehouse for restocking the first-echelon\nwarehouses. Customer orders can be partially satisfied, but the total fraction of completed orders\nshould not be less than the specified threshold. We need to minimize the total cost of storing the\nitems in all warehouses. We use a deterministic simulation to calculate the order satisfaction ratio\nand the storage cost during the planning period. The simulation depends on inventory\nmanagement policies at each warehouse for each type of items. We develop a decomposition\nmethod for solving the problem. It is based on solution of subproblems for each type of items.\nAlso, we propose some approaches to exact solution of the problem. The results of numerical\nexperiments with instances with 100 warehouses and 1000 types of items are presented. On\ninstances with known exact solutions, we have the optimum in two cases, while in the other cases\nthe deviation from the optimal values is at most 1.9%.\n</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 4","pages":"918 - 934"},"PeriodicalIF":0.5800,"publicationDate":"2025-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Decomposition Approach for a Two-Echelon Inventory\\nManagement System\",\"authors\":\"A. D. Yuskov, I. N. Kulachenko, A. A. Melnikov, Yu. A. Kochetov\",\"doi\":\"10.1134/S1990478924040239\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p> Warehouses of the first echelon in a two-echelon system are designed to satisfy customer\\norders. In the second echelon, we have a central warehouse for restocking the first-echelon\\nwarehouses. Customer orders can be partially satisfied, but the total fraction of completed orders\\nshould not be less than the specified threshold. We need to minimize the total cost of storing the\\nitems in all warehouses. We use a deterministic simulation to calculate the order satisfaction ratio\\nand the storage cost during the planning period. The simulation depends on inventory\\nmanagement policies at each warehouse for each type of items. We develop a decomposition\\nmethod for solving the problem. It is based on solution of subproblems for each type of items.\\nAlso, we propose some approaches to exact solution of the problem. The results of numerical\\nexperiments with instances with 100 warehouses and 1000 types of items are presented. On\\ninstances with known exact solutions, we have the optimum in two cases, while in the other cases\\nthe deviation from the optimal values is at most 1.9%.\\n</p>\",\"PeriodicalId\":607,\"journal\":{\"name\":\"Journal of Applied and Industrial Mathematics\",\"volume\":\"18 4\",\"pages\":\"918 - 934\"},\"PeriodicalIF\":0.5800,\"publicationDate\":\"2025-07-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Applied and Industrial Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://link.springer.com/article/10.1134/S1990478924040239\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied and Industrial Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.1134/S1990478924040239","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
Decomposition Approach for a Two-Echelon Inventory
Management System
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 to 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%.
期刊介绍:
Journal of Applied and Industrial Mathematics is a journal that publishes original and review articles containing theoretical results and those of interest for applications in various branches of industry. The journal topics include the qualitative theory of differential equations in application to mechanics, physics, chemistry, biology, technical and natural processes; mathematical modeling in mechanics, physics, engineering, chemistry, biology, ecology, medicine, etc.; control theory; discrete optimization; discrete structures and extremum problems; combinatorics; control and reliability of discrete circuits; mathematical programming; mathematical models and methods for making optimal decisions; models of theory of scheduling, location and replacement of equipment; modeling the control processes; development and analysis of algorithms; synthesis and complexity of control systems; automata theory; graph theory; game theory and its applications; coding theory; scheduling theory; and theory of circuits.