Please use this identifier to cite or link to this item:
|Title:||Adjusted network flow for the shelf-space allocation problem||Authors:||Lim, A.
|Issue Date:||2002||Citation:||Lim, A.,Rodrigues, B.,Xiao, F.,Zhang, X. (2002). Adjusted network flow for the shelf-space allocation problem. Proceedings of the International Conference on Tools with Artificial Intelligence : 224-232. ScholarBank@NUS Repository.||Abstract:||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 multi-dimensional 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 adaptation 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.||Source Title:||Proceedings of the International Conference on Tools with Artificial Intelligence||URI:||http://scholarbank.nus.edu.sg/handle/10635/40382||ISSN:||10636730|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 2, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.