.png){kind=icon}
返回
Optimizing Retail Assortments
.png){kind=icon}
OA
AI
DOI：10.1287/mksc.2013.0800.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Retailers face the problem of finding the assortment that maximizes category profit. This is a challenging task because the number. of potential assortments is very large when there are many stock-keeping units (SKUs) to choose from. Moreover, SKIT sales can be cannibalized by other SKUs in the assortment, and the more similar SKUs are, the more this happens. This paper develops an implementable and scalable assortment optimization method that allows for theory-based substitution patterns and optimizes real-life, large-scale assortments at the store level. We achieve this by adopting an attribute-based approach to capture preferences, substitution patterns, and cross-marketing mix effects. To solve the optimization problem, we propose new very large neighborhood search heuristics. We apply our methodology to store-level scanner data on liquid laundry detergent. The optimal assortments are expected to enhance retailer profit considerably (37.3%), and this profit increases even more (to 43.7%) when SKU prices are optimized simultaneously.
Keyword:
retail assortments
optimization
product attributes
substitution
similarity
endogeneity
heuristics
micromarketing
pricing
hierarchical Bayes
Gibbs sampling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.1
论文数:
3.4K
被引数:
2.2W
机构
引用论文
Does ideology matter?: Anecdotal experimental evidence on the voluntary provision of public goods
.png){kind=icon}
PREAI
分享收藏分享收藏
查看更多内容