TY - JOUR
T1 - A Discrete Constrained Optimization Using Genetic Algorithms for A Bookstore Layout
AU - Ozcan, Tuncay
AU - Esnaf, Sakir
PY - 2013/4
Y1 - 2013/4
N2 - In retail industry, one of the most important decisions of shelf space management is the shelf location decision for products and product categories to be displayed in-store. The shelf location that products are displayed has a significant impact on product sales. At the same time, displaying complementary products close to each other increases the possibility of cross-selling of products. In this study, firstly, for a bookstore retailer, a mathematical model is developed based on association rule mining for store layout problem which includes the determination of the position of products and product categories which are displayed in-store shelves. Then, because of the NP-hard nature of the developed model, an original heuristic approach is developed based on genetic algorithms for solving large-scale real-life problems. In order to compare the performance of the genetic algorithm based heuristic with other methods, another heuristic approach based on tabu search and a simple heuristic that is commonly used by retailers are proposed. Finally, the effectiveness and applicability of the developed approaches are illustrated with numerical examples and a case study with data taken from a bookstore.
AB - In retail industry, one of the most important decisions of shelf space management is the shelf location decision for products and product categories to be displayed in-store. The shelf location that products are displayed has a significant impact on product sales. At the same time, displaying complementary products close to each other increases the possibility of cross-selling of products. In this study, firstly, for a bookstore retailer, a mathematical model is developed based on association rule mining for store layout problem which includes the determination of the position of products and product categories which are displayed in-store shelves. Then, because of the NP-hard nature of the developed model, an original heuristic approach is developed based on genetic algorithms for solving large-scale real-life problems. In order to compare the performance of the genetic algorithm based heuristic with other methods, another heuristic approach based on tabu search and a simple heuristic that is commonly used by retailers are proposed. Finally, the effectiveness and applicability of the developed approaches are illustrated with numerical examples and a case study with data taken from a bookstore.
KW - Association rule mining
KW - Genetic algorithms
KW - Shelf location
KW - Store layout
KW - Tabu search
UR - http://www.scopus.com/inward/record.url?scp=84874479530&partnerID=8YFLogxK
U2 - 10.1080/18756891.2013.768447
DO - 10.1080/18756891.2013.768447
M3 - Article
AN - SCOPUS:84874479530
SN - 1875-6891
VL - 6
SP - 261
EP - 278
JO - International Journal of Computational Intelligence Systems
JF - International Journal of Computational Intelligence Systems
IS - 2
ER -