亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

Newsvendor Problems With Product Unbundling: An Approach Combining Robust Optimization With Deep Reinforcement Learning

报童模式 计算机科学 稳健优化 强化学习 分拆 利润(经济学) 数学优化 马尔可夫决策过程 捆绑 斯塔克伯格竞赛 产品(数学) 运筹学 微观经济学 人工智能 供应链 业务 经济 数学 马尔可夫过程 营销 统计 万维网 复合材料 材料科学 几何学
作者
Xiaoli Yan,Frank Chen,Hui Yu,Jiawen Li
出处
期刊:Production and Operations Management [Wiley]
卷期号:34 (11): 3629-3646 被引量:1
标识
DOI:10.1177/10591478251344225
摘要

In fashion, food processing, petrochemical production, and agriculture, products (items) are often bundled in a prefixed assortment, with a given ratio for each product. For example, one case of men’s shoes may contain 24 pairs of different sizes of the same design. Of the 24 pairs, there is one size 7 pair, four sizes 9, and so on. Moreover, those pairs of shoes are packaged independently for retailing. Retailers of such products order them in bundles and then resell them unbundled. In this study, we propose and analyze a newsvendor model in which a retailer decides the order quantity of the whole bundle before the uncertain demand for each product/item is realized. We call it a product unbundling newsvendor problem (PUNP): How should the retailer decide the ordering quantity of a product bundle to meet the unknown demands of individual items to maximize its expected profit? We approach this problem with a robust optimization approach that assumes the means and covariance matrix of stochastic demands but not the demand distributions. However, the robust approach that considers the worst-case demand scenario is perceived to be conservative. In this study, we incorporate the distributionally robust optimization with deep reinforcement learning (DRL) and propose a new paradigm of robust learning to improve the robust decision quality. We take this robust solution, that is, the order quantity and profit, as human domain knowledge and implement it into the decision-making process of DRL by designing a policy transfer mechanism. Unsurprisingly, the exact robust solution is computationally intractable; thus, we provide an approximate solution. Simulations were conducted based on limited data sizes, confirming that our approach effectively improves robust performance. Moreover, the hybrid approach significantly outperforms the DRL approach. In the meantime, reduced computing costs and increased interpretability of decision recommendations may facilitate the deployment of DRL algorithms in operational practice. Furthermore, the successful application of the hybrid approach in addressing several variants of the PUNP indicates that the proposed mechanism may provide a pathway for solving complex operational problems.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
djking发布了新的文献求助10
1秒前
djking发布了新的文献求助10
1秒前
4秒前
10秒前
11秒前
微光发布了新的文献求助10
15秒前
内向鸣凤完成签到,获得积分10
44秒前
科研通AI2S应助科研通管家采纳,获得10
48秒前
小二郎应助科研通管家采纳,获得10
48秒前
Hello应助科研通管家采纳,获得10
49秒前
赘婿应助科研通管家采纳,获得10
49秒前
49秒前
54秒前
56秒前
58秒前
1分钟前
1分钟前
大力凡旋完成签到,获得积分10
1分钟前
1分钟前
1分钟前
1分钟前
顾矜应助djking采纳,获得10
1分钟前
1分钟前
1分钟前
超级的迎梅完成签到,获得积分10
2分钟前
minnie完成签到 ,获得积分10
2分钟前
2分钟前
任性刚发布了新的文献求助10
2分钟前
大马宝蛋应助Bin_Liu采纳,获得10
2分钟前
2分钟前
ming2026应助科研通管家采纳,获得10
2分钟前
wanci应助科研通管家采纳,获得10
2分钟前
孤独怀寒完成签到,获得积分10
3分钟前
绝望的文盲完成签到,获得积分10
3分钟前
molihuakai应助研友_8WbP4Z采纳,获得10
3分钟前
记上没文献了完成签到 ,获得积分10
3分钟前
科研通AI6.4应助研友_惊鸿采纳,获得10
3分钟前
认真的笑卉完成签到,获得积分10
3分钟前
3分钟前
研友_惊鸿发布了新的文献求助10
3分钟前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
China Pluperfect I: Epistemology of Past and Outside in Chinese Art 520
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
基于锂离子电池正极材料回收的绿色溶剂开发及工程化应用研究 500
Auslegungsgeschichte 500
Cosmos as Art Object: Studies in Plato's Timaeus and Other Dialogues 500
Middle East Patterns 444
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7640146
求助须知:如何正确求助?哪些是违规求助? 9213205
关于积分的说明 19763421
捐赠科研通 7206299
什么是DOI,文献DOI怎么找? 3276074
关于科研通互助平台的介绍 2437673
邀请新用户注册赠送积分活动 2273470