Omnichannel Assortment Optimization Under the Multinomial Logit Model with a Features Tree

Venus Lo, Huseyin Topaloglu
{"title":"Omnichannel Assortment Optimization Under the Multinomial Logit Model with a Features Tree","authors":"Venus Lo, Huseyin Topaloglu","doi":"10.1287/msom.2021.1001","DOIUrl":null,"url":null,"abstract":"Problem definition: We consider the assortment optimization problem of a retailer that operates a physical store and an online store. The products that can be offered are described by their features. Customers purchase among the products that are offered in their preferred store. However, customers who purchase from the online store can first test out products offered in the physical store. These customers revise their preferences for online products based on the features that are shared with the in-store products. The full assortment is offered online, and the goal is to select an assortment for the physical store to maximize the retailer’s total expected revenue. Academic/practical relevance: The physical store’s assortment affects preferences for online products. Unlike traditional assortment optimization, the physical store’s assortment influences revenue from both stores. Methodology: We introduce a features tree to organize products by features. The nonleaf vertices on the tree correspond to features, and the leaf vertices correspond to products. The ancestors of a leaf correspond to features of the product. Customers choose among the products within their store’s assortment according to the multinomial logit model. We consider two settings; either all customers purchase online after viewing products in the physical store, or we have a mix of customers purchasing from each store. Results: When all customers purchase online, we give an efficient algorithm to find the optimal assortment to display in the physical store. With a mix of customers, the problem becomes NP-hard, and we give a fully polynomial-time approximation scheme. We numerically demonstrate that we can closely approximate the case where products have arbitrary combinations of features without a tree structure and that our fully polynomial-time approximation scheme performs remarkably well. Managerial implications: We characterize conditions under which it is optimal to display expensive products with underrated features and expose inexpensive products with overrated features.","PeriodicalId":18108,"journal":{"name":"Manuf. Serv. Oper. Manag.","volume":"17 1","pages":"1220-1240"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Manuf. Serv. Oper. Manag.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/msom.2021.1001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Problem definition: We consider the assortment optimization problem of a retailer that operates a physical store and an online store. The products that can be offered are described by their features. Customers purchase among the products that are offered in their preferred store. However, customers who purchase from the online store can first test out products offered in the physical store. These customers revise their preferences for online products based on the features that are shared with the in-store products. The full assortment is offered online, and the goal is to select an assortment for the physical store to maximize the retailer’s total expected revenue. Academic/practical relevance: The physical store’s assortment affects preferences for online products. Unlike traditional assortment optimization, the physical store’s assortment influences revenue from both stores. Methodology: We introduce a features tree to organize products by features. The nonleaf vertices on the tree correspond to features, and the leaf vertices correspond to products. The ancestors of a leaf correspond to features of the product. Customers choose among the products within their store’s assortment according to the multinomial logit model. We consider two settings; either all customers purchase online after viewing products in the physical store, or we have a mix of customers purchasing from each store. Results: When all customers purchase online, we give an efficient algorithm to find the optimal assortment to display in the physical store. With a mix of customers, the problem becomes NP-hard, and we give a fully polynomial-time approximation scheme. We numerically demonstrate that we can closely approximate the case where products have arbitrary combinations of features without a tree structure and that our fully polynomial-time approximation scheme performs remarkably well. Managerial implications: We characterize conditions under which it is optimal to display expensive products with underrated features and expose inexpensive products with overrated features.
特征树多项式Logit模型下的全渠道分类优化
问题定义:我们考虑经营实体店和网上商店的零售商的分类优化问题。可以提供的产品是通过它们的特性来描述的。顾客在他们喜欢的商店提供的产品中购买。然而,从网上商店购买的顾客可以先试用实体店提供的产品。这些客户根据与实体店产品共享的特性来修改他们对在线产品的偏好。在线提供完整的分类,目标是为实体店选择分类,以最大化零售商的总预期收入。学术/实践相关性:实体店的分类会影响人们对在线产品的偏好。与传统的分类优化不同,实体店的分类会影响两家店的收入。方法:我们引入了一个功能树来按功能组织产品。树的非叶顶点对应特征,叶顶点对应产品。叶子的祖先对应于产品的特征。顾客根据多项logit模型在商店的产品分类中进行选择。我们考虑两种情况;所有客户在实体店查看产品后在线购买,或者我们有从每个商店购买的混合客户。结果:当所有顾客都在网上购物时,我们给出了一种有效的算法来找到在实体店展示的最佳分类。对于混合客户,问题变得np困难,我们给出了一个完全多项式时间近似格式。我们在数值上证明,我们可以近似地逼近产品具有任意特征组合而没有树结构的情况,并且我们的完全多项式时间近似方案执行得非常好。管理意义:我们描述了在哪些条件下展示功能被低估的昂贵产品和暴露功能被高估的廉价产品是最佳的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信