Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
On properties of stochastic inventory systems
Management Science
Using the deterministic EOQ formula in stochastic inventory control
Management Science
Commercial Use of Upc Scanner Data: Industry and Academic Perspectives
Marketing Science
Management of Multi-Item Retail Inventory Systems with Demand Substitution
Operations Research
Stocking Retail Assortments Under Dynamic Consumer Substitution
Operations Research
A Modeling Framework for Category Assortment Planning
Manufacturing & Service Operations Management
A survey of very large-scale neighborhood search techniques
Discrete Applied Mathematics
Enriching Scanner Panel Models with Choice Experiments
Marketing Science
Decomposing the Sales Promotion Bump with Store Data
Marketing Science
The Effect of Product Assortment Changes on Customer Retention
Marketing Science
Hi-index | 0.00 |
Retailers face the problem of finding the assortment that maximizes category profit. This is a challenging task because the number of potential assortments is very large when there are many stock-keeping units SKUs to choose from. Moreover, SKU sales can be cannibalized by other SKUs in the assortment, and the more similar SKUs are, the more this happens. This paper develops an implementable and scalable assortment optimization method that allows for theory-based substitution patterns and optimizes real-life, large-scale assortments at the store level. We achieve this by adopting an attribute-based approach to capture preferences, substitution patterns, and cross-marketing mix effects. To solve the optimization problem, we propose new very large neighborhood search heuristics. We apply our methodology to store-level scanner data on liquid laundry detergent. The optimal assortments are expected to enhance retailer profit considerably 37.3%, and this profit increases even more to 43.7% when SKU prices are optimized simultaneously.