Publication Type
Journal Article
Version
publishedVersion
Publication Date
1-2004
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.
Keywords
retail, shelf allocation, metaheuristics, retail industry
Discipline
Operations and Supply Chain Management | Sales and Merchandising
Research Areas
Operations Management
Publication
Management Science
Volume
50
Issue
1
First Page
117
Last Page
131
ISSN
0025-1909
Identifier
10.1287/mnsc.1030.0165
Publisher
INFORMS
Citation
LIM, Andrew; RODRIGUES, Brian; and ZHANG, Xingwen.
Metaheuristics with Local Search Techniques for Retail Shelf-Space Optimization. (2004). Management Science. 50, (1), 117-131.
Available at: https://ink.library.smu.edu.sg/lkcsb_research/3791
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.1287/mnsc.1030.0165
Comments
Published version made available in SMU repository with permission of INFORMS, 2014, February 28