{"title":"Optimal order quantities of a multi-period inventory of compatible products","authors":"Doraid Dalalah","doi":"10.1016/j.cie.2025.111338","DOIUrl":null,"url":null,"abstract":"<div><div>Effectively managing perishable inventory that consists of a heterogeneous assortment of mutually compatible products presents a complex and computationally challenging problem in operations research and supply chain fields. This particular problem arises when certain products can serve as substitutes for others, an operation commonly observed in maintenance parts, electronics, pharmaceuticals, batteries, and various other industries. Unlike single-period/single-product inventory models, where closed form solutions like the classical newsvendor are available in the literature, the compatibility between multiple products across multiple planning periods has remained largely unexplored in previous research.</div><div>Thus, the objective of our study is to find the optimal order quantities of different product types in an inventory system to minimize shortages and expiration, taking into account the challenging aspects of perishability and the existence of compatible substitutes. To rigorously address the complexities of this inventory system, a mixed-integer linear programming (MILP) framework is developed to encapsulate the intricate structural and operational characteristics of the problem. The proposed model is designed to accommodate both deterministic and stochastic scenarios, enabling the derivation of exact and approximate solutions through the integration of advanced optimization and simulation-based methodologies.</div><div>For large-scale instances, we recognize the computational challenges that arise when using standard solvers. Consequently, a metaheuristic algorithm is developed, which is specifically designed to reduce the computational time required to solve big instances. By tackling the interplay between perishability, compatibility, and multi periods, our study pushes the boundaries of existing research and presents innovative solution to real inventory where product substitution is allowed.</div><div>The findings showed that less shortages and expiration result in the case of compatible products. Compatibility also results in less order quantities. For a single inventory period, compatibility demonstrates higher effect on reducing the expected shortage and spoilage. For the case of full compatibility where any product can serve as a substitute for the others, closed form solution can be found for single period planning, while in multiple period planning, MILP optimization is required to address the problem. Finally, when compatibility is not present, it will lead to independent demand, thereby making the classical newsvendor problem applicable to this special case, but even in this case, optimization will be required for multi-period.</div><div>The proposed model exhibits broad applicability across a wide spectrum of industrial and medical applications, including but not limited to management of spare parts inventory, pharmaceutical supply chains, perishable food products such as dairy and ready-to-eat meals, the automotive sector, and systems involving modular subassemblies.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"207 ","pages":"Article 111338"},"PeriodicalIF":6.5000,"publicationDate":"2025-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Industrial Engineering","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S036083522500484X","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
Effectively managing perishable inventory that consists of a heterogeneous assortment of mutually compatible products presents a complex and computationally challenging problem in operations research and supply chain fields. This particular problem arises when certain products can serve as substitutes for others, an operation commonly observed in maintenance parts, electronics, pharmaceuticals, batteries, and various other industries. Unlike single-period/single-product inventory models, where closed form solutions like the classical newsvendor are available in the literature, the compatibility between multiple products across multiple planning periods has remained largely unexplored in previous research.
Thus, the objective of our study is to find the optimal order quantities of different product types in an inventory system to minimize shortages and expiration, taking into account the challenging aspects of perishability and the existence of compatible substitutes. To rigorously address the complexities of this inventory system, a mixed-integer linear programming (MILP) framework is developed to encapsulate the intricate structural and operational characteristics of the problem. The proposed model is designed to accommodate both deterministic and stochastic scenarios, enabling the derivation of exact and approximate solutions through the integration of advanced optimization and simulation-based methodologies.
For large-scale instances, we recognize the computational challenges that arise when using standard solvers. Consequently, a metaheuristic algorithm is developed, which is specifically designed to reduce the computational time required to solve big instances. By tackling the interplay between perishability, compatibility, and multi periods, our study pushes the boundaries of existing research and presents innovative solution to real inventory where product substitution is allowed.
The findings showed that less shortages and expiration result in the case of compatible products. Compatibility also results in less order quantities. For a single inventory period, compatibility demonstrates higher effect on reducing the expected shortage and spoilage. For the case of full compatibility where any product can serve as a substitute for the others, closed form solution can be found for single period planning, while in multiple period planning, MILP optimization is required to address the problem. Finally, when compatibility is not present, it will lead to independent demand, thereby making the classical newsvendor problem applicable to this special case, but even in this case, optimization will be required for multi-period.
The proposed model exhibits broad applicability across a wide spectrum of industrial and medical applications, including but not limited to management of spare parts inventory, pharmaceutical supply chains, perishable food products such as dairy and ready-to-eat meals, the automotive sector, and systems involving modular subassemblies.
期刊介绍:
Computers & Industrial Engineering (CAIE) is dedicated to researchers, educators, and practitioners in industrial engineering and related fields. Pioneering the integration of computers in research, education, and practice, industrial engineering has evolved to make computers and electronic communication integral to its domain. CAIE publishes original contributions focusing on the development of novel computerized methodologies to address industrial engineering problems. It also highlights the applications of these methodologies to issues within the broader industrial engineering and associated communities. The journal actively encourages submissions that push the boundaries of fundamental theories and concepts in industrial engineering techniques.