Record Details

Optimal Retail Shelf Space Allocation with Dynamic Programming using Bounds

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Optimal Retail Shelf Space Allocation with Dynamic Programming using Bounds
 
Creator GAJJAR, HK
ADIL, GK
 
Subject display-area allocation
product assortment
model
sales
optimization
supermarkets
management
algorithm
selection
retail
shelf space allocation models
dynamic programming
bounds
 
Description 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.
 
Publisher IEEE
 
Date 2011-07-31T12:35:45Z
2011-12-26T12:53:01Z
2011-12-27T05:40:05Z
2011-07-31T12:35:45Z
2011-12-26T12:53:01Z
2011-12-27T05:40:05Z
2008
 
Type Article
 
Identifier IEEM: 2008 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS 1-3, (), 1068-1072
http://dspace.library.iitb.ac.in/xmlui/handle/10054/8122
http://hdl.handle.net/10054/8122
 
Language en