Shelves on which products are being displayed are one of the most important resources in retail environment. The decision of shelf-space allocation and management is therefore a critical issue in retail operation management. In this paper a hybrid algorithm that combines a genetic algorithm with a variable neighborhood search is proposed to address the shop shelf allocation problem. Results obtained from an extensive experimental phase show the suitability of the proposed algorithm in addressing the problem at hand
Castelli, M., Vanneschi, L. (2014). Genetic algorithm with variable neighborhood search for the optimal allocation of goods in shop shelves. OPERATIONS RESEARCH LETTERS, 42(5), 355-360 [10.1016/j.orl.2014.06.002].
Genetic algorithm with variable neighborhood search for the optimal allocation of goods in shop shelves
CASTELLI, MAUROPrimo
;VANNESCHI, LEONARDOSecondo
2014
Abstract
Shelves on which products are being displayed are one of the most important resources in retail environment. The decision of shelf-space allocation and management is therefore a critical issue in retail operation management. In this paper a hybrid algorithm that combines a genetic algorithm with a variable neighborhood search is proposed to address the shop shelf allocation problem. Results obtained from an extensive experimental phase show the suitability of the proposed algorithm in addressing the problem at handI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.