Teaching-learning based optimization (TLBO) with variable neighborhood search to retail shelf-space allocation

18Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.

Abstract

Shelf space is a scarce and expensive resource in the retail industry because a large number of products compete for limited display space. Thus, shelf-space allocation is frequently implemented in shops to increase product sales and profits. In the past few decades, numerous models and solution methods have been developed to deal with the shelf-space allocation problem (SSAP). In this paper, a novel population-oriented metaheuristic algorithm, teaching-learning-based optimization (TLBO) is applied to solve the problem and compared with existing solution methods with respect to their solution performance. Further, a hybrid algorithm that combines TLBO with variable neighborhood search (VNS) is proposed to enhance the performance of the basic TLBO. The research results show that the proposed TLBO-VNS algorithm is superior to other algorithms in terms of solution performance, in addition to using fewer control parameters. Therefore, the proposed TLBO-VNS algorithm has considerable potential in solving SSAP.

Cite

CITATION STYLE

APA

Chen, Y. K., Weng, S. X., & Liu, T. P. (2020). Teaching-learning based optimization (TLBO) with variable neighborhood search to retail shelf-space allocation. Mathematics, 8(8). https://doi.org/10.3390/MATH8081296

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free