Adjusted Network Flow for the Shelf Space Allocation Problem

• Main Authors: LIM, Andrew, RODRIGUES, Brian, XIAO, Fei, ZHANG, Xingwen
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2002
• Subjects: Operations and Supply Chain Management
• Online Access: https://ink.library.smu.edu.sg/lkcsb_research/2074; https://doi.ieeecomputersociety.org/10.1109/TAI.2002.1180808
• Institution: Singapore Management University

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.