Metaheuristics with Local Search Techniques for Retail Shelf-Space Optimization

Abstract

Efficient shelf-space allocation can provide retailers with a competitive edge. While there has been little study on this subject, there is great interest in improving product allocation in the retail industry. This paper examines a practicable linear allocation model for optimizing shelf-space allocation. It extends the model to address other requirements such as product groupings and nonlinear profit functions. Besides providing a network flow solution, we put forward a strategy that combines a strong local search with a metaheuristic approach to space allocation. This strategy is flexible and efficient, as it can address both linear and nonlinear problems of realistic size while achieving near-optimal solutions through easily implemented algorithms in reasonable timescales. It offers retailers opportunities for more efficient and profitable shelf management, as well as higher-quality planograms.

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 — 139 citations exist upstream.

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