.png){kind=icon}
Return
Data mining-based algorithm for assortment planning
.png){kind=icon}
PRE
AI
DOI：10.1080/23270012.2020.1725666.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Retail assortment
SKU rationalization
data mining
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.5
Papers:
218
Citations:
949
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
View more