A Heuristic Approach for a Shelf Space Allocation Problem

Hande Erol Bingüler, Serol Bulkan, Mustafa Ağaoğlu

Abstract


A shelf space allocation problem (SSAP) is a special form of multi-constraint knapsack problem. The main difference between a knapsack problem and a SSAP is that a knapsack problem has only capacity constraints. Commercial space management systems use many different heuristic approaches for allocating shelf space due to the NP-hard complexity of the SSAP. These heuristics are usually based on simple intuitive rules that could be easily used in practice to implement shelf space allocation decisions. This paper develops a new heuristic to obtain a good allocation of shelf space for different products in order to increase profitability under different constraints such as limited shelf space and elasticity factors.

Full Text:

38-44

Refbacks

  • There are currently no refbacks.


Copyright (c) 2019 Journal of Management and Information Science

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.