Name
Abstract | ||
|---|---|---|
We propose two recommendation algorithms for e-commerce with supply limits, a scenario that has not been intensively studied in the literature. One algorithm is a linear programming-based algorithm that uses historical data to approximate customer arrival patterns and generate shadow prices for inventories. The price of inventory can be introduced to existing recommendation algorithms to obtain adjusted rankings for recommendation. The other algorithm balances expected revenue and inventory consumption, and it uses a simple penalty function to reduce the chance of recommending low-inventory-level products. Both algorithms are suitable for online recommendation systems for grocery stores with both online and offline channels, and can incorporate the features of perishable products, which need to be sold within limited time. Both algorithms are tested in a simulation using estimated parameters from Freshippo, a supermarket owned by the Alibaba Group. The numerical results show that both algorithms can generate higher sales volume and higher revenue. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/BigData50022.2020.9378261 | 2020 IEEE International Conference on Big Data (Big Data) |
Keywords | DocType | ISSN |
E-commerce,Top-K recommendation,Robust Ranking,Linear Programming | Conference | 2639-1589 |
ISBN | Citations | PageRank |
978-1-7281-6252-2 | 0 | 0.34 |
References | Authors | |
0 | 8 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Du Chen | 1 | 26 | 10.15 |
| Yuming Deng | 2 | 6 | 2.44 |
| Guangrui Ma | 3 | 0 | 0.34 |
| Hao Ge | 4 | 9 | 4.76 |
| Yunwei Qi | 5 | 1 | 0.69 |
| Ying Rong | 6 | 101 | 8.03 |
| Xun Zhang | 7 | 0 | 0.34 |
| Huan Zheng | 8 | 64 | 5.28 |