Randomized Assortment Optimization

IF 2.2 3区 管理学 Q3 MANAGEMENT
Zhengchao Wang, Heikki Peura, Wolfram Wiesemann
{"title":"Randomized Assortment Optimization","authors":"Zhengchao Wang, Heikki Peura, Wolfram Wiesemann","doi":"10.1287/opre.2022.0129","DOIUrl":null,"url":null,"abstract":"<p>When a firm selects an assortment of products to offer to customers, it uses a choice model to anticipate their probability of purchasing each product. In practice, the estimation of these models is subject to statistical errors, which may lead to significantly suboptimal assortment decisions. Recent work has addressed this issue using robust optimization, where the true parameter values are assumed unknown and the firm chooses an assortment that maximizes its worst-case expected revenues over an uncertainty set of likely parameter values, thus mitigating estimation errors. In this paper, we introduce the concept of <i>randomization</i> into the robust assortment optimization literature. We show that the standard approach of deterministically selecting a single assortment to offer is not always optimal in the robust assortment optimization problem. Instead, the firm can improve its worst-case expected revenues by selecting an assortment randomly according to a prudently designed probability distribution. We demonstrate this potential benefit of randomization both theoretically in an abstract problem formulation as well as empirically across three popular choice models: the multinomial logit model, the Markov chain model, and the preference ranking model. We show how an optimal randomization strategy can be determined exactly and heuristically. Besides the superior in-sample performance of randomized assortments, we demonstrate improved out-of-sample performance in a data-driven setting that combines estimation with optimization. Our results suggest that more general versions of the assortment optimization problem—incorporating business constraints, more flexible choice models and/or more general uncertainty sets—tend to be more receptive to the benefits of randomization.</p><p><b>Funding:</b> Z. Wang acknowledges funding from the Imperial College President’s PhD Scholarship programme. W. Wiesemann acknowledges funding from the Engineering and Physical Sciences Research Council [Grants EP/R045518/1, EP/T024712/1, and EP/W003317/1].</p><p><b>Supplemental Material:</b> The online appendix is available at https://doi.org/10.1287/opre.2022.0129.</p>","PeriodicalId":54680,"journal":{"name":"Operations Research","volume":null,"pages":null},"PeriodicalIF":2.2000,"publicationDate":"2024-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1287/opre.2022.0129","RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MANAGEMENT","Score":null,"Total":0}
引用次数: 0

Abstract

When a firm selects an assortment of products to offer to customers, it uses a choice model to anticipate their probability of purchasing each product. In practice, the estimation of these models is subject to statistical errors, which may lead to significantly suboptimal assortment decisions. Recent work has addressed this issue using robust optimization, where the true parameter values are assumed unknown and the firm chooses an assortment that maximizes its worst-case expected revenues over an uncertainty set of likely parameter values, thus mitigating estimation errors. In this paper, we introduce the concept of randomization into the robust assortment optimization literature. We show that the standard approach of deterministically selecting a single assortment to offer is not always optimal in the robust assortment optimization problem. Instead, the firm can improve its worst-case expected revenues by selecting an assortment randomly according to a prudently designed probability distribution. We demonstrate this potential benefit of randomization both theoretically in an abstract problem formulation as well as empirically across three popular choice models: the multinomial logit model, the Markov chain model, and the preference ranking model. We show how an optimal randomization strategy can be determined exactly and heuristically. Besides the superior in-sample performance of randomized assortments, we demonstrate improved out-of-sample performance in a data-driven setting that combines estimation with optimization. Our results suggest that more general versions of the assortment optimization problem—incorporating business constraints, more flexible choice models and/or more general uncertainty sets—tend to be more receptive to the benefits of randomization.

Funding: Z. Wang acknowledges funding from the Imperial College President’s PhD Scholarship programme. W. Wiesemann acknowledges funding from the Engineering and Physical Sciences Research Council [Grants EP/R045518/1, EP/T024712/1, and EP/W003317/1].

Supplemental Material: The online appendix is available at https://doi.org/10.1287/opre.2022.0129.

随机分类优化
企业在选择向客户提供的产品种类时,会使用选择模型来预测客户购买每种产品的概率。在实践中,这些模型的估计会受到统计误差的影响,从而可能导致明显的次优分类决策。最近的研究利用稳健优化法解决了这一问题,即假定真实参数值未知,企业选择的产品组合应能在不确定的可能参数值集合上最大化最坏情况下的预期收益,从而减少估计误差。在本文中,我们将随机化概念引入稳健分类优化文献。我们表明,在稳健分类优化问题中,确定性地选择单一分类提供的标准方法并不总是最优的。相反,企业可以根据谨慎设计的概率分布随机选择一个品种,从而提高最坏情况下的预期收益。我们通过抽象问题的理论表述以及三种常用选择模型(多项式 logit 模型、马尔可夫链模型和偏好排序模型)的经验证明了随机化的潜在优势。我们展示了如何精确地和启发式地确定最优随机化策略。除了随机排列的样本内性能优越外,我们还展示了在数据驱动的情况下,将估计与优化相结合所提高的样本外性能。我们的研究结果表明,包含商业约束、更灵活的选择模型和/或更一般的不确定性集的更一般版本的分类优化问题,往往更容易接受随机化的好处:Z. Wang感谢帝国理工学院院长博士奖学金项目的资助。W. Wiesemann感谢工程与物理科学研究委员会的资助[资助EP/R045518/1、EP/T024712/1和EP/W003317/1]:在线附录见 https://doi.org/10.1287/opre.2022.0129。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Operations Research
Operations Research 管理科学-运筹学与管理科学
CiteScore
4.80
自引率
14.80%
发文量
237
审稿时长
15 months
期刊介绍: Operations Research publishes quality operations research and management science works of interest to the OR practitioner and researcher in three substantive categories: methods, data-based operational science, and the practice of OR. The journal seeks papers reporting underlying data-based principles of operational science, observations and modeling of operating systems, contributions to the methods and models of OR, case histories of applications, review articles, and discussions of the administrative environment, history, policy, practice, future, and arenas of application of operations research.
×
引用
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学术官方微信