An Investigation of Automated Planograms Using a Simulated Annealing Based Hyper-Heuristic

This paper formulates the shelf space allocation problem as a non-linear function of the product net profit and store-inventory. We show that this model is an extension of multi-knapsack problem, which is itself an NP-hard problem. A two-stage relaxation is carried out to get an upper bound of the model. A simulated annealing based hyper-heuristic algorithm is proposed to solve several problem instances with different problem sizes and space ratios. The results show that the simulated annealing hyper-heuristic significantly outperforms two conventional simulated annealing algorithms and other hyper-heuristics for all problem instances. The experimental results show that our approach is a robust and efficient approach for the shelf space allocation problem.

[1]  P. Farris,et al.  A Model for Determining Retail Product Category Assortment and Shelf Space Allocation , 1994 .

[2]  S. Baron Retailing Management , 1992 .

[3]  Ming-Hsien Yang,et al.  An efficient algorithm to allocate shelf space , 2001, Eur. J. Oper. Res..

[4]  Graham Kendall,et al.  A Tabu-Search Hyperheuristic for Timetabling and Rostering , 2003, J. Heuristics.

[5]  Peter Ross,et al.  Solving a Real-World Problem Using an Evolving Heuristically Driven Schedule Builder , 1998, Evolutionary Computation.

[6]  J. Kotzan,et al.  Responsiveness of Drug Store Sales to Shelf Space Allocations , 1969 .

[7]  K. Cox,et al.  The Effect of Shelf Space upon Sales of Branded Products , 1970 .

[8]  P. Cowling,et al.  A Parameter-Free Hyperheuristic for Scheduling a Sales Summit , 2002 .

[9]  Graham Kendall,et al.  An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[10]  M. Corstjens,et al.  A Model for Optimizing Retail Space Allocations , 1981 .

[11]  Timothy L. Urban,et al.  A Deterministic Inventory System with an Inventory-Level-Dependent Demand Rate , 1988 .

[12]  F. Glover,et al.  In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

[13]  David Connolly An improved annealing scheme for the QAP , 1990 .

[14]  Fred S. Zufryden,et al.  A Dynamic Programming Approach for Product Selection and Supermarket Shelf-Space Allocation , 1986 .

[15]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[16]  Ronald C. Curhan The Relationship between Shelf Space and Unit Sales in Supermarkets , 1972 .

[17]  Ann Verhetsel,et al.  The impact of location factors on the attractiveness and optimal space shares of product categories , 2000 .

[18]  Roy Thurik,et al.  Consumer response to the preferred brand out‐of‐stock situation , 1998 .

[19]  Valérie Renaudin,et al.  Estimation of Product Category Sales Responsiveness to Allocated Shelf Space , 1998 .

[20]  Graham Kendall,et al.  Hyper-Heuristics: An Emerging Direction in Modern Search Technology , 2003, Handbook of Metaheuristics.

[21]  Timothy L. Urban An inventory-theoretic approach to product assortment and shelf-space allocation , 1998 .

[22]  Alexander Nareyek,et al.  Choosing search heuristics by non-stationary reinforcement learning , 2004 .

[23]  Graham Kendall,et al.  An adaptive Length chromosome Hyper-Heuristic Genetic Algorithm for a Trainer Scheduling Problem , 2002, SEAL.

[24]  Timothy L. Urban The interdependence of inventory management and retail shelf management , 2002 .

[25]  N. Given Learning a procedure that can solve hard bin-packing problems: a new GA-based approach to hyper-heuristics , 2003 .

[26]  Stephen J. Hoch,et al.  Shelf management and space elasticity , 1994 .

[27]  Graham Kendall,et al.  Adaptively ParameterisedHyperheuristics for Sales Summit Scheduling , 2001 .

[28]  Ming-Hsien Yang,et al.  A study on shelf space allocation and management , 1999 .

[29]  Alistair I. Mees,et al.  Convergence of an annealing algorithm , 1986, Math. Program..

[30]  C. Reeves Modern heuristic techniques for combinatorial problems , 1993 .

[31]  Peter Ross,et al.  Learning a Procedure That Can Solve Hard Bin-Packing Problems: A New GA-Based Approach to Hyper-heuristics , 2003, GECCO.

[32]  Ronald C. Curhan Shelf Space Allocation and Profit Maximization in Mass Retailing , 1973 .

[33]  Graham Kendall,et al.  A Hyperheuristic Approach to Scheduling a Sales Summit , 2000, PATAT.

[34]  Yih-Long Chang,et al.  A simulated annealing approach to scheduling a manufacturing cell , 1990 .