Optimal outbound shipment policy for an inventory system with advance demand information

IF 6 2区 管理学 Q1 OPERATIONS RESEARCH & MANAGEMENT SCIENCE European Journal of Operational Research Pub Date : 2025-07-01 Epub Date: 2025-01-24 DOI:10.1016/j.ejor.2025.01.020
Jana Ralfs, Dai T. Pham, Gudrun P. Kiesmüller
{"title":"Optimal outbound shipment policy for an inventory system with advance demand information","authors":"Jana Ralfs,&nbsp;Dai T. Pham,&nbsp;Gudrun P. Kiesmüller","doi":"10.1016/j.ejor.2025.01.020","DOIUrl":null,"url":null,"abstract":"<div><div>This paper examines a single-echelon inventory system that fulfills stochastic orders from a production facility using a time-based shipment consolidation strategy. In this system, the production facility provides advance demand information to the warehouse, ensuring that all orders are placed with a positive demand lead time. Using value iteration, we identify the optimal outbound shipment quantities while accounting for costs related to early deliveries, late deliveries, and shipments. Additionally, this research highlights the impact of advance demand information on transportation capacity planning and the optimization of load factors</div><div>The results from value iteration enable us to observe the general structure of the optimal dispatch policy, and we determine that it is a multidimensional threshold policy. Based on this observation, we introduce an approximated three-level threshold policy with acceptable performance. Furthermore, the decision itself is easier to interpret and to explain. To analyze large-scale instances, we compare several heuristic policies. First, we develop a deep reinforcement learning algorithm that approximates the value of the post-decision state instead of the pre-decision state. We compare our approach to value iteration and find that our method works very well; the average optimality gap is 0.08%. Additionally, three simple heuristic policies are proposed that might be justifiable in specific situations.</div><div>Finally, we find that the value of advance demand information does not follow a linear pattern but decreases as the demand lead time increases. Furthermore, the transportation capacity should be planned in the range of the mean demand between two shipments.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"324 1","pages":"Pages 92-103"},"PeriodicalIF":6.0000,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Journal of Operational Research","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0377221725000451","RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/1/24 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0

Abstract

This paper examines a single-echelon inventory system that fulfills stochastic orders from a production facility using a time-based shipment consolidation strategy. In this system, the production facility provides advance demand information to the warehouse, ensuring that all orders are placed with a positive demand lead time. Using value iteration, we identify the optimal outbound shipment quantities while accounting for costs related to early deliveries, late deliveries, and shipments. Additionally, this research highlights the impact of advance demand information on transportation capacity planning and the optimization of load factors
The results from value iteration enable us to observe the general structure of the optimal dispatch policy, and we determine that it is a multidimensional threshold policy. Based on this observation, we introduce an approximated three-level threshold policy with acceptable performance. Furthermore, the decision itself is easier to interpret and to explain. To analyze large-scale instances, we compare several heuristic policies. First, we develop a deep reinforcement learning algorithm that approximates the value of the post-decision state instead of the pre-decision state. We compare our approach to value iteration and find that our method works very well; the average optimality gap is 0.08%. Additionally, three simple heuristic policies are proposed that might be justifiable in specific situations.
Finally, we find that the value of advance demand information does not follow a linear pattern but decreases as the demand lead time increases. Furthermore, the transportation capacity should be planned in the range of the mean demand between two shipments.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有预先需求信息的库存系统的最优出站运输策略
本文研究了一个单梯队库存系统,该系统使用基于时间的运输整合策略来满足生产设施的随机订单。在这个系统中,生产设施向仓库提供提前的需求信息,确保所有订单都有一个积极的需求交货时间。使用价值迭代,我们在计算与早期交付、延迟交付和装运相关的成本的同时,确定最佳的出站运输数量。此外,本研究还强调了预先需求信息对运输能力规划和载客率优化的影响
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
European Journal of Operational Research
European Journal of Operational Research 管理科学-运筹学与管理科学
CiteScore
11.90
自引率
9.40%
发文量
786
审稿时长
8.2 months
期刊介绍: The European Journal of Operational Research (EJOR) publishes high quality, original papers that contribute to the methodology of operational research (OR) and to the practice of decision making.
期刊最新文献
Recent developments in location-routing problems Super-efficiency in piecewise Cobb-Douglas technology with flexible endogenous direction Increasing competitiveness by imbalanced groups: The example of the 48-team FIFA World Cup A hybrid multi-layered ensemble model based on heterogeneous information network for small and medium-sized enterprise default prediction A global malmquist productivity index of athletics performance in olympic games
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1