Article ID: | iaor20131884 |
Volume: | 11 |
Issue: | 1 |
Start Page Number: | 31 |
End Page Number: | 55 |
Publication Date: | Mar 2013 |
Journal: | 4OR |
Authors: | Burke Edmund, Kendall Graham, Bai Ruibin, Woensel Tom |
Keywords: | combinatorial optimization, programming: integer, optimization: simulated annealing, heuristics |
In this paper, we propose a two‐dimensional shelf space allocation model. The second dimension stems from the height of the shelf. This results in an integer nonlinear programming model with a complex form of objective function. We propose a multiple neighborhood approach which is a hybridization of a simulated annealing algorithm with a hyper‐heuristic learning mechanism. Experiments based on empirical data from both real‐world and artificial instances show that the shelf space utilization and the resulting sales can be greatly improved when compared with a gradient method. Sensitivity analysis on the input parameters and the shelf space show the benefits of the proposed algorithm both in sales and in robustness.