Adjusted Network Flow for the Shelf Space Allocation Problem
Conference Proceeding Article
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 recentfindings significantly and are very close to the optimal.
Operations and Supply Chain Management
ICTAI 2002: 14th IEEE International Conference on Tools with Artificial Intelligence: Proceedings: 4-6 November 2002, Washington DC
City or Country
LIM, Andrew; RODRIGUES, Brian; XIAO, Fei; and ZHANG, Xingwen.
Adjusted Network Flow for the Shelf Space Allocation Problem. (2002). ICTAI 2002: 14th IEEE International Conference on Tools with Artificial Intelligence: Proceedings: 4-6 November 2002, Washington DC. 224-229. Research Collection Lee Kong Chian School Of Business.
Available at: http://ink.library.smu.edu.sg/lkcsb_research/2074