A genetic algorithm for the retail shelf space allocation problem with virtual segments

Kateryna Czerniachowska ()
Additional contact information
Kateryna Czerniachowska: Wroclaw University of Economics and Business

OPSEARCH, 2022, vol. 59, issue 1, No 14, 364-412

Abstract: Abstract Shelf space allocation is the problem of methodologically allocating products on shelves in retail stores to maximize profit, improve clients’ satisfaction, and improve stock management. Scarce shelf space is the most important and challenging resource to manage for small retailers. Most literature analyzes general models which are appropriate for many retail stores. Still, they can only be used as part of the whole process as they do not reflect complicated category management rules. In this paper, a practical shelf space allocation model is proposed, which combines retailers’ visual merchandising practices, categorized into five groups of constraint types with the aim of maximizing profit. A method is proposed to find an optimal solution for pallet shelves. The solution for other shelves was developed using a genetic algorithm, which integrates three practical techniques of solution improvement. The efficiency of the proposed approach was evaluated using CPLEX solver. The results of computational experiments show that this approach allows for perfect results for small and large product numbers in a sufficient running time.

Keywords: Metaheuristics; Merchandising; Planogram; Retailing; Shelf space allocation (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s12597-021-00551-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:opsear:v:59:y:2022:i:1:d:10.1007_s12597-021-00551-3

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/12597

DOI: 10.1007/s12597-021-00551-3

Access Statistics for this article

OPSEARCH is currently edited by Birendra Mandal

More articles in OPSEARCH from Springer, Operational Research Society of India
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().