.png){kind=icon}
返回
Data mining-based algorithm for assortment planning
.png){kind=icon}
PRE
AI
DOI：10.1080/23270012.2020.1725666.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
With increasing varieties and products, management of limited shelf space becomes quite difficult for retailers. Hence, an efficient product assortment, which in turn helps to plan the organization of various products across limited shelf space, is extremely important for retailers. Products can be distinguished based on quality, price, brand, and other attributes, and decision needs to be made about an assortment of the products based on these attributes. An efficient assortment planning improves the financial performance of the retailer by increasing profits and reducing operational costs. Clustering techniques can be very effective in grouping products, stores, etc. and help managers solve the problem of assortment planning. This paper proposes data mining approaches for assortment planning for profit maximization with space, and cost constraints by mapping it into well-known knapsack problem.
Keyword:
Retail assortment
SKU rationalization
data mining
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.5
论文数:
218
被引数:
949
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容