In-Out Algorithm for assortment planning under a ranking-based consumer choice model
Operations Research Letters(2020)
摘要
We consider a retailer’s assortment planning problem under a ranking-based consumer choice model. The retailer incurs a fixed carrying cost per product offered, a substitution penalty cost for each customer who does not purchase his first choice, and a penalty cost on lost sales. We develop an effective In–Out Algorithm to identify the optimal solution. The extensive numerical study shows that the algorithm performs well, and is more than 10,000 times faster than enumeration on problems with 20 products.
更多查看译文
关键词
Retailing,Assortment planning,Ranking-based choice model,Algorithm
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要