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

نویسندگان

  • Ruibin Bai
  • Graham Kendall
چکیده

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 close all of its high street outlets. Yet another example is the decline of J Sainsbury from its position as the leading food retailer in the UK in the 1990’s (in 1996, Tesco opened up a 2% lead over their rivals and continue to maintain an advantage). The recent merger of Asda and Wal-Mart is expected to bring increased pressure on other retailers due to the buying power of Wal-Mart. Finally, there is a battle over Safeways, which is currently up for sale.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

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 ...

متن کامل

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...

متن کامل

Scheduling Problem of Virtual Cellular Manufacturing Systems (VCMS); Using Simulated Annealing and Genetic Algorithm based Heuristics

In this paper, we present a simulated annealing (SA) and a genetic algorithm (GA) based on heuristics for scheduling problem of jobs in virtual cellular manufacturing systems. A virtual manufacturing cell (VMC) is a group of resources that is dedicated to the manufacturing of a part family. Although this grouping is not reflected in the physical structure of the manufacturing system, but machin...

متن کامل

Scheduling Problem of Virtual Cellular Manufacturing Systems (VCMS); Using Simulated Annealing and Genetic Algorithm based Heuristics

In this paper, we present a simulated annealing (SA) and a genetic algorithm (GA) based on heuristics for scheduling problem of jobs in virtual cellular manufacturing systems. A virtual manufacturing cell (VMC) is a group of resources that is dedicated to the manufacturing of a part family. Although this grouping is not reflected in the physical structure of the manufacturing system, but machin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003