How big should my store be? On the interplay between shelf-space, demand learning and assortment decisions
A fundamental decision every merchant has to make is on is how large his stores should be. This is particularly true in light of the drastic changes retail concepts have seen in the last decade. There has been a noticeable tendency, particularly for food and convenience retailers, to open more and smaller stores. Also, there has been a well-documented recent shift in paradigm in apparel retailing with the so called fast-fashion business model. Short lead times have resulted in flexibility that allows retailers to adjust the assortment of products offered on sale at their stores quickly enough to adapt to popular fashion trends. Based on revised estimates of the merchandise's popularity, they then weed out unpopular items and re-stock demonstrably popular ones on a week-by-week basis. However, despite the obvious similarity of reliance on better demand learning, fashion-fashion retailers like Zara have opted to do exactly the opposite as groceries and opened sizable stores in premium locations. This paradox has not been explained in the literature so far. In this paper, we aim to calculate the profit of a retailer in such a complicated environment with demand learning and frequent assortment decisions in particular in dependence of the most valuable resource of a retailer: shelf-space. To be able to achieve this, we extend the recent approaches in the management literature to handle the sequential resource allocation problems that arises in this context with a concurrent need for learning. We investigate the use of multi-armed bandits to model the assortment decisions under demand learning, whereby this aspect is captured by a Bayesian Gamma-Poisson model. Our model enables us to characterize the marginal value of shelf-space and to calculate the optimal store size under learning and assortment decisions. An extensive numerical study confirms that the store size choices observed in real life can be explained by the varying length of selling seasons different retailers face.
|Date of creation:||Dec 2012|
|Date of revision:||Dec 2012|
|Contact details of provider:|| Web page: http://www.lums.lancs.ac.uk/departments/ManSci/|
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Felipe Caro & Jérémie Gallien, 2007. "Dynamic Assortment with Demand Learning for Seasonal Consumer Goods," Management Science, INFORMS, vol. 53(2), pages 276-292, February.
- Yang, Ming-Hsien & Chen, Wen-Cher, 1999. "A study on shelf space allocation and management," International Journal of Production Economics, Elsevier, vol. 60(1), pages 309-317, April.
- Brezzi, Monica & Lai, Tze Leung, 2002. "Optimal learning and experimentation in bandit problems," Journal of Economic Dynamics and Control, Elsevier, vol. 27(1), pages 87-108, November.
- Yücel, Eda & Karaesmen, Fikri & Salman, F. Sibel & Türkay, Metin, 2009. "Optimizing product assortment under customer-driven demand substitution," European Journal of Operational Research, Elsevier, vol. 199(3), pages 759-768, December.
- Hariga, Moncer A. & Al-Ahmari, Abdulrahman & Mohamed, Abdel-Rahman A., 2007. "A joint optimisation model for inventory replenishment, product assortment, shelf space and display area allocation decisions," European Journal of Operational Research, Elsevier, vol. 181(1), pages 239-251, August.
- Marcel Corstjens & Peter Doyle, 1981. "A Model for Optimizing Retail Space Allocations," Management Science, INFORMS, vol. 27(7), pages 822-833, July.
When requesting a correction, please mention this item's handle: RePEc:lms:mansci:mrg-0021. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joern Meissner)
If references are entirely missing, you can add them using this form.