Proceedings ArticleDOI
Optimal retail shelf space allocation with dynamic programming using bounds
Hasmukh K. Gajjar,Gajendra Kumar Adil +1 more
- pp 1068-1072
Reads0
Chats0
TLDR
It is found from experimental studies that NDP using bound was much more efficient to solve large problems as compared to original dynamic programming (ODP) without using bound.Abstract:
Efficient shelf space allocation increases profitability of a retail store and thus provides competitive advantage to the retailer. Several shelf space allocation models exist in literature. However, these models are generally solved using heuristic approaches due to NP-hard nature and there is a need to develop exact methods. In this paper, we present a non-linear shelf-space allocation model (NLSSAM) and optimally solve it with a new dynamic programming (NDP) using bounds which fathoms unpromising states. It is found from experimental studies that NDP using bound was much more efficient to solve large problems as compared to original dynamic programming (ODP) without using bound. ODP could not solve all problem instances of problem sizes (number of products, n = 30 and 40) within specified CPU time limit of 400 seconds while NDP could solved problem instances of size (n = 200) with average CPU time of 7.89 seconds.read more
References
More filters
Dissertation
An investigation of novel approaches for optimising retail shelf space allocation
TL;DR: In this article, a generic search technique, hyper-heuristics, was proposed to solve real-world shelf space allocation problems that arise due to the conflict of limited shelf space availability and the large number of products that need to be displayed.
Journal ArticleDOI
Reversed geometric programming: A branch-and-bound method involving linear subproblems
TL;DR: In this article, a branch-and-bound method is proposed to find the global solution of general polynomial programs, where the problem is first transformed into a reversed posynomial program.
Related Papers (5)
Exact optimization and decomposition approaches for shelf space allocation
A queueing network approach to the module allocation problem in distributed systems
R. M. Bryant,J. R. Agre +1 more