A Heuristic Approach to Shelf Space Allocation Decision Support Including Facings, Capping, and Nesting

Abstract

Shelf space on which products are exhibited is a scarce resource in the retail environment. Retailers regularly make decisions related to allocating products to their outlets’ limited shelf space. The aim of the paper was to develop a practical shelf space allocation model offering the possibility of horizontal and vertical product grouping, representing an item (product) with facings, capping, and nesting, with the objective of maximizing the retailer’s profit. Because real category-management problems address a lot of retailer’s rules, we expanded the basic shelf space allocation model, using shelf constraints, product constraints, multi-shelves constraints, and category constraints. To solve the problem, we proposed two adjustable methods that allowed us to achieve good results within a short time interval. The validity of algorithms was estimated, using the CPLEX solver and illustrated with example problems. Experiments were performed on data generated on the basis of real retail values. To estimate the performance of the proposed approach, 45 cases were tested. Among them, the proposed approach found solutions in 34 cases, while CPLEX found solutions only in 23 cases. The profit ratio of the proposed approach is, on average, 94.57%, with minimal and maximal values of 86.80% and 99.84%, accordingly.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 16 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.