Solving the optimal order quantity with unknown parameters for products with stock-dependent demand and variable holding cost rate

IF 0.9 4区 数学 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Zhanbing Guo, Yejie Zhang
{"title":"Solving the optimal order quantity with unknown parameters for products with stock-dependent demand and variable holding cost rate","authors":"Zhanbing Guo, Yejie Zhang","doi":"10.1007/s10878-025-01260-z","DOIUrl":null,"url":null,"abstract":"<p>Solving the optimal order quantity for products with stock-dependent demand is a challenging task as both exact values of multiple parameters and complicated procedures are required. Motivated by this practical dilemma, this paper develops a new method to overcome the above-mentioned two challenges simultaneously. This new method, referred as two-stage AEOQ (adaptive economic order quantity) policy, includes the following two merits when managing products with stock-dependent demand and variable holding cost rate. First, it is feasible even when the values of underlying parameters are unknown. Second, it is easy-to-implement as decisions are made via adaptively recalibrating the inputs of classical EOQ formula by observable variables in the previous period. Theoretical analysis and numerical example show that this two-stage AEOQ policy could obtain the optimal order quantity. Moreover, this two-stage AEOQ policy is robust to parameter misestimation, and performs better than the traditional solution method when the underlying parameters are volatile. Finally, it is shown that this two-stage AEOQ policy could be further simplified when the fixed ordering cost is negligible. Therefore, this study provides a feasible order policy when the exact values of underlying parameters are unable to gain or when the economic environment is volatile.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"45 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2025-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10878-025-01260-z","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Solving the optimal order quantity for products with stock-dependent demand is a challenging task as both exact values of multiple parameters and complicated procedures are required. Motivated by this practical dilemma, this paper develops a new method to overcome the above-mentioned two challenges simultaneously. This new method, referred as two-stage AEOQ (adaptive economic order quantity) policy, includes the following two merits when managing products with stock-dependent demand and variable holding cost rate. First, it is feasible even when the values of underlying parameters are unknown. Second, it is easy-to-implement as decisions are made via adaptively recalibrating the inputs of classical EOQ formula by observable variables in the previous period. Theoretical analysis and numerical example show that this two-stage AEOQ policy could obtain the optimal order quantity. Moreover, this two-stage AEOQ policy is robust to parameter misestimation, and performs better than the traditional solution method when the underlying parameters are volatile. Finally, it is shown that this two-stage AEOQ policy could be further simplified when the fixed ordering cost is negligible. Therefore, this study provides a feasible order policy when the exact values of underlying parameters are unable to gain or when the economic environment is volatile.

求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Combinatorial Optimization
Journal of Combinatorial Optimization 数学-计算机:跨学科应用
CiteScore
2.00
自引率
10.00%
发文量
83
审稿时长
6 months
期刊介绍: The objective of Journal of Combinatorial Optimization is to advance and promote the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering. The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信