Record Details

A piecewise linearization for retail shelf space allocation problem and a local search heuristic

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title A piecewise linearization for retail shelf space allocation problem and a local search heuristic
 
Creator GAJJAR, HK
ADIL, GK
 
Subject display-area allocation
product assortment
model
sales
management
optimization
supermarkets
selection
retail
shelf space allocation
piecewise linearization
upper bound
heuristics
 
Description Retail shelf space allocation problem is well known in literature. In this paper, we make three contributions to retail shelf space allocation problem considering space elasticity (SSAPSE). First, we reformulate an existing nonlinear model for SSAPSE to an integer programming (IP) model using piecewise linearization. Second, we show that the linear programming relaxation of the proposed IP model produces tight upper bound. Third, we develop a heuristic that consistently produces near optimal solutions for randomly generated instances of problems with size (products, shelves) varying from (25, 5) to (200, 50) within a minute of CPU time.
 
Publisher SPRINGER
 
Date 2011-08-29T08:58:29Z
2011-12-26T12:58:31Z
2011-12-27T05:48:35Z
2011-08-29T08:58:29Z
2011-12-26T12:58:31Z
2011-12-27T05:48:35Z
2010
 
Type Article
 
Identifier ANNALS OF OPERATIONS RESEARCH, 179(1), 149-167
0254-5330
http://dx.doi.org/10.1007/s10479-008-0455-6
http://dspace.library.iitb.ac.in/xmlui/handle/10054/12033
http://hdl.handle.net/10054/12033
 
Language en