Header menu link for other important links

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

, Gajendra K. Adil
Published in Springer
Volume: 179
Pages: 149 - 167

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.

About the journal
JournalData powered by TypesetAnnals of Operations Research
PublisherData powered by TypesetSpringer
Open AccessNo