loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
14th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'02)
Adjusted Network Flow for the Shelf-Space Allocation Problem
Washington, DC
November 04-November 06
ISBN: 0-7695-1849-4
Andrew Lim, National University of Singapore and Hong Kong Unversity of Science and Technology
Brian Rodrigues, Singapore Management University
Fei Xiao, National University of Singapore
Xingwen Zhang, National University of Singapore
In this paper, we study shelf space allocation optimization which is important to retail operations management. Our approach is to formulate a model that is applicable to operational realities and to seek solutions with realistic test data. This model is linked to the multidimensional knapsack problem. We first solve a simplified version of the problem to achieve maximum profit by transforming it into a network flow problem. Then, with simple adaptations we solve the general shelf space allocation problem with the help of the network flow model. The approach is simple and direct while experimental results improve on recent findings significantly and are very close to the optimal.
Citation:
Andrew Lim, Brian Rodrigues, Fei Xiao, Xingwen Zhang, "Adjusted Network Flow for the Shelf-Space Allocation Problem," ictai, pp.224, 14th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.