Shrinking the Upper Confidence Bound : A Dynamic Product Selection Problem for Urban Warehouses
The recent rising popularity of ultra-fast delivery services on retail platforms fuels the increasing use of urban warehouses, whose proximity to customers makes fast deliveries viable. The space limit in urban warehouses poses a problem for the online retailers: the number of products (SKUs) they carry is no longer "the more, the better", yet it can still be significantly large, reaching hundreds or thousands in a product category. In this paper, we study algorithms for dynamically selecting a large number of products (i.e., SKUs) with top customer purchase probabilities on the fly, from an ocean of potential products to offer on retailers' ultra-fast delivery platforms.We distill the product selection problem into a semi-bandit model with linear generalization. There are in total N different arms, each with a feature vector of dimension d. The player pulls K arms in each period and observes the bandit feedback from each of the pulled arms. We focus on the setting where K is much greater than the number of total time periods T or the dimension of product features d. We first analyze a standard UCB algorithm and show its regret bound can be expressed as the sum of a T-independent part Õ(Kd<sup>3/2</sup>) and a T-dependent part Õ(d √(KT)), which we refer to as "fixed cost" and "variable cost" respectively. To reduce the fixed cost for large K values, we propose a novel online learning algorithm, which iteratively shrinks the upper confidence bounds within each period, and show its fixed cost is reduced by a factor of d to Õ(K √(d)). Moreover, we test the algorithms on an industrial dataset from Alibaba Group. Experimental results show that our new algorithm reduces the total regret of the standard UCB algorithm by at least 10%
Year of publication: |
2019
|
---|---|
Authors: | Jin, Rong |
Other Persons: | Simchi-Levi, David (contributor) ; Wang, Li (contributor) ; Wang, Xinshang (contributor) ; Yang, Sen (contributor) |
Publisher: |
[2019]: [S.l.] : SSRN |
Saved in:
freely available
Extent: | 1 Online-Ressource (30 p) |
---|---|
Type of publication: | Book / Working Paper |
Language: | English |
Notes: | Nach Informationen von SSRN wurde die ursprüngliche Fassung des Dokuments February 26, 2019 erstellt |
Other identifiers: | 10.2139/ssrn.3342761 [DOI] |
Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012891625
Saved in favorites
Similar items by person
-
Shrinking the upper confidence bound : a dynamic product selection problem for urban warehouses
Jin, Rong, (2021)
-
Distributionally Robust Omnichannel Stocking Decisions in Quick Fulfillment Systems
Chen, Louis, (2019)
-
Inventory balancing with online learning
Cheung, Wang Chi, (2022)
- More ...