Product assortment and space allocation strategies to attract loyal and non-loyal customers

Abstract Assortment planning deserves much attention from practitioners and academics due to its direct impact on retailers’ commercial success. In this paper we focus on the increasingly popular retail practice to use combined product assortments with both “standard” and more fashionable and short-lived “variable” products for building up store traffic of “loyal” and “non-loyal” heterogeneous customers and enlarging the sales due to the potential cross-selling effect. Addressing the assortment planning as a bilevel optimization problem, we focus on decision-dependent uncertainties: the retailer’s binary decision about product inclusion influences the distribution of the product’s demand. Furthermore, our model accounts for customers’ optimal purchase quantities, which depend on budget constraints limiting the basket that a customer is able to purchase. We propose iterative heuristics using optimal quantization of demand and customers budget distributions to define the total assortment and the inventory level per product. These heuristics provide lower bounds on the optimal value. We conduct a comparison to other existing lower bounds and we formulate upper bounds via linear (LP) and semidefinite (SDP) relaxations for the performance evaluation of the heuristics and for an efficient numerical solution in high-dimensional cases. For managerial insights, we compare the proposed approach with three assortment planning strategies: (1) the retailer does not carry variable products; (2) the retailer ignores the cross-selling effect; and (3) the maximum space allocated to each product is fixed. Our results suggest that variable assortment boosts the retailers profits if the cross-selling effect is not neglected in the decision about products quantities.

[1]  Stefan Hochrainer-Stigler,et al.  Large scale extreme risk assessment using copulas: an application to drought events under climate change for Austria , 2019, Comput. Manag. Sci..

[2]  Stephen A. Smith Optimizing Retail Assortments for Diverse Customer Preferences , 2008 .

[3]  Stephen A. Smith,et al.  Estimating negative binomial demand for retail inventory management with unobservable lost sales , 1996 .

[4]  G. Lantos Private Label Strategy: How to Meet the Store Brand Challenge , 2008 .

[5]  Felix Hueber,et al.  Production And Operations Analysis , 2016 .

[6]  Mark D. Uncles,et al.  Discrete Choice Analysis: Theory and Application to Travel Demand , 1987 .

[7]  S. Graf,et al.  Foundations of Quantization for Probability Distributions , 2000 .

[8]  Hanna Schramm-Klein,et al.  Strategic Retail Management: Text and International Cases , 2007 .

[9]  Patrice Marcotte,et al.  An overview of bilevel optimization , 2007, Ann. Oper. Res..

[10]  Herminia I. Calvete,et al.  A new approach for solving linear bilevel problems using genetic algorithms , 2008, Eur. J. Oper. Res..

[11]  Juan José Miranda Bront,et al.  A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem , 2010, Electron. Notes Discret. Math..

[12]  Pascal Van Hentenryck,et al.  Assortment Optimization under the Sequential Multinomial Logit Model , 2017, Eur. J. Oper. Res..

[13]  Pierre Hansen,et al.  Product selection and space allocation in supermarkets , 1979 .

[14]  Shandong Mou,et al.  Retail store operations: Literature review and research directions , 2018, Eur. J. Oper. Res..

[15]  J. Aitchison,et al.  The lognormal distribution : with special reference to its uses in economics , 1957 .

[16]  Abdel Lisser,et al.  Knapsack problem with probability constraints , 2011, J. Glob. Optim..

[17]  G. Grisetti,et al.  Further Reading , 1984, IEEE Spectrum.

[18]  David F. Pyke,et al.  Inventory management and production planning and scheduling , 1998 .

[19]  R. Weismantel,et al.  A Semidefinite Programming Approach to the Quadratic Knapsack Problem , 2000, J. Comb. Optim..

[20]  R. Fortet L’algebre de Boole et ses applications en recherche operationnelle , 1960 .

[21]  D. Walters,et al.  Retail Strategy: Planning and Control , 2000 .

[22]  Masoud Rabbani,et al.  Integrating assortment selection, pricing and mixed-bundling problems for multiple retail categories under cross-selling , 2017 .

[23]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems , 1994, Discret. Appl. Math..

[24]  Ralf W. Seifert,et al.  Joint Product Assortment, Inventory and Price Optimization to Attract Loyal and Non-loyal Customers , 2014 .

[25]  Warren P. Adams,et al.  A hierarchy of relaxation between the continuous and convex hull representations , 1990 .

[26]  Narendra Agrawal,et al.  Management of Multi-Item Retail Inventory Systems with Demand Substitution , 2000, Oper. Res..

[27]  G. Pflug,et al.  Approximations for Probability Distributions and Stochastic Optimization Problems , 2011 .

[28]  Bacel Maddah,et al.  Integrated retail decisions with multiple selling periods and customer segments: Optimization and insights , 2015 .

[29]  Pushpendra Kumar,et al.  An Overview On Bilevel Programming , 2012 .

[30]  Wenhong Luo,et al.  The Analytics Movement: Implications for Operations Research , 2010, Interfaces.

[31]  H. Murat Afsar,et al.  A Branch-and-Price Algorithm for Capacitated Arc Routing Problem with Flexible Time Windows , 2010, Electron. Notes Discret. Math..

[32]  S. Rachev,et al.  Mass transportation problems , 1998 .

[33]  Andrew Lim,et al.  Metaheuristics with Local Search Techniques for Retail Shelf-Space Optimization , 2004, Manag. Sci..

[34]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..

[35]  Anna V. Timonina,et al.  Multi-stage stochastic optimization: the distance between stochastic scenario processes , 2015, Comput. Manag. Sci..

[36]  Franz Rendl,et al.  Bounds for the quadratic assignment problem using the bundle method , 2007, Math. Program..

[37]  Garrett J. van Ryzin,et al.  Stocking Retail Assortments Under Dynamic Consumer Substitution , 2001, Oper. Res..

[38]  J. Bard Some properties of the bilevel programming problem , 1991 .

[39]  Zhaolin Li,et al.  A Single‐Period Assortment Optimization Model , 2009 .

[40]  Robert Fildes,et al.  Reassessing the scope of OR practice: The Influences of Problem Structuring Methods and the Analytics Movement , 2015, Eur. J. Oper. Res..

[41]  Heinrich Kuhn,et al.  An efficient algorithm for capacitated assortment planning with stochastic demand and substitution , 2016, Eur. J. Oper. Res..

[42]  Jeanne G. Harris,et al.  Competing on Analytics: The New Science of Winning , 2007 .

[43]  Stephen A. Smith,et al.  Optimal retail assortments for substitutable items purchased in sets , 2003 .

[44]  L. Kantorovich On the Translocation of Masses , 2006 .

[45]  Juan-Carlos Ferrer,et al.  Consumer price sensitivity in the retail industry: Latitude of acceptance with heterogeneous demand , 2013, Eur. J. Oper. Res..

[46]  Charles E. Blair,et al.  Computational Difficulties of Bilevel Linear Programming , 1990, Oper. Res..

[47]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[48]  B. Bhattacharyya Wal Smart: What it really takes to profit in a Wal-Mart world , 2009 .

[49]  R. K. Amit,et al.  Optimal shelf-space stocking policy using stochastic dominance under supply-driven demand uncertainty , 2015, Eur. J. Oper. Res..

[50]  M. Fisher,et al.  Assortment Planning: Review of Literature and Industry Practice , 2008 .

[51]  Iris F. A. Vis,et al.  Lost-sales inventory theory: A review , 2011, Eur. J. Oper. Res..

[52]  C. Villani Optimal Transport: Old and New , 2008 .

[53]  Marshall L. Fisher,et al.  Demand Estimation and Assortment Optimization Under Substitution: Methodology and Application , 2007, Oper. Res..

[54]  Dhruv Grewal,et al.  Planning Merchandising Decisions to Account for Regional and Product Assortment Differences , 1999 .

[55]  Jonathan F. Bard,et al.  Practical Bilevel Optimization: Algorithms and Applications , 1998 .

[56]  G. Ryzin,et al.  On the Relationship Between Inventory Costs and Variety Benefits in Retailassortments , 1999 .

[57]  André de Palma,et al.  Discrete Choice Theory of Product Differentiation , 1995 .

[58]  Ming-Hsien Yang,et al.  An efficient algorithm to allocate shelf space , 2001, Eur. J. Oper. Res..