Name
Abstract | ||
|---|---|---|
Shelf space is one of the most important resources of a retail firm. This paper formulates a model and proposes an approach which is similar to the algorithm used for solving a knapsack problem. Subject to given constraints, the proposed heuristic allocates shelf space item by item according to a descending order of sales profit for each item per display area or length. Through the use of simulations, the performances of objective value and the computational efficiency of this method are evaluated. Three options are also proposed for improving the heuristics. Compared to an optimal method, the improved heuristic is shown to be a very efficient algorithm which allocates shelf space at near-optimal levels. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1016/S0377-2217(99)00448-8 | European Journal of Operational Research |
Keywords | Field | DocType |
Heuristics,Retailing,Shelf space allocation | Heuristic,Mathematical optimization,Gross profit,Algorithm,Heuristics,Knapsack problem,Mathematics,Operations management | Journal |
Volume | Issue | ISSN |
131 | 1 | 0377-2217 |
Citations | PageRank | References |
45 | 4.50 | 3 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ming-hsien Yang | 1 | 87 | 12.03 |