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.
منابع مشابه
An Investigation of Automated Planograms Using a Simulated Annealing Based Hyper-heuristics
The retailing sector in the UK is an extremely competitive arena. We only need to consider some high profile companies to show that this is the case. A particular example is provided by a recent decline of Marks and Spencer, who were the leading high street retailer (in recent years they are stating to show an improvement in their profitability). A further example is given by C&A’s decision to ...
متن کاملMonte Carlo hyper-heuristics for examination timetabling
Automating the neighbourhood selection process in an iterative approach that uses multiple heuristics is not a trivial task. Hyper-heuristics are search methodologies that not only aim to provide a general framework for solving problem instances at different difficulty levels in a given domain, but a key goal is also to extend the level of generality so that different problems from different do...
متن کاملKSATS-HH: A Simulated Annealing Hyper-Heuristic with Reinforcement Learning and Tabu-Search
The term hyper-heuristics describes a broad range of techniques that attempt to provide solutions to an array of problems from different domains. This paper describes the implementation of a hyperheuristic developed for entry into the Cross-domain Heuristic Search Challenge organised by the Automated Scheduling, Optimisation and Planning research group at the University of Nottingham. An algori...
متن کاملCross-domain Heuristic Search Challenge: GISS Algorithm presentation
Generic Iterative Simulated-Annealing Search (GISS) is a hyper-heuristic algorithm inspired on a Simulated Annealing driven method, on this context its used to explore across the different instance-heuristicstate search space. On this extended abstract we describe the proposed approach, characteristics and others technicals parameters.
متن کاملA Hyper-Heuristic Using GRASP with Path-Relinking: A Case Study of the Nurse Rostering Problem
The goal of hyper-heuristics is to design and choose heuristics to solve complex problems. The primary motivation behind the hyper-heuristics is to generalize the solving ability of the heuristics. In this paper, the authors propose a Hyper-heuristic using GRASP with Path-Relinking (HyGrasPr). HyGrasPr generates heuristic sequences to produce solutions within an iterative procedure. The procedu...
متن کامل