Journal
2020 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA)
Volume -, Issue -, Pages 617-622Publisher
IEEE
DOI: 10.1109/BigData50022.2020.9378261
Keywords
E-commerce; Top-K recommendation; Robust Ranking; Linear Programming
Categories
Funding
- National Natural Science Foundation of China [71871139, 71632007]
- Alibaba Innovative Research Program
Ask authors/readers for more resources
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. Roth 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 he sold within limited time. Roth 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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available