Results 1 - 10
of
26
A Tabu-Search Hyperheuristic for Timetabling and Rostering
, 2003
"... Hyperheuristics can be defined to be heuristics which choose between heuristics in order to solve a given optimisation problem. The main motivation behind the development of such approaches is the goal of developing automated scheduling methods which are not restricted to one problem. In this paper ..."
Abstract
-
Cited by 95 (45 self)
- Add to MetaCart
Hyperheuristics can be defined to be heuristics which choose between heuristics in order to solve a given optimisation problem. The main motivation behind the development of such approaches is the goal of developing automated scheduling methods which are not restricted to one problem. In this paper we report the investigation of a hyperheuristic approach and evaluate it on various instances of two distinct timetabling and rostering problems. In the framework of our hyperheuristic approach, heuristics compete using rules based on the principles of reinforcement learning. A tabu list of heuristics is also maintained which prevents certain heuristics from being chosen at certain times during the search. We demonstrate that this tabu-search hyperheuristic is an easily re-usable method which can produce solutions of at least acceptable quality across a variety of problems and instances. In effect the proposed method is capable of producing solutions that are competitive with those obtained using stateof -the-art problem-specific techniques for the problems studied here, but is fundamentally more general than those techniques.
Hyper-Heuristics: An Emerging Direction In Modern Search Technology
, 2003
"... This chapter introduces and overviews an emerging methodology in search and optimisation. One of the key aims of these new approaches, which have been termed hyper-heuristics, is to raise the level of generality at which optimisation systems can operate. An objective is that hyper-heuristics will le ..."
Abstract
-
Cited by 55 (26 self)
- Add to MetaCart
This chapter introduces and overviews an emerging methodology in search and optimisation. One of the key aims of these new approaches, which have been termed hyper-heuristics, is to raise the level of generality at which optimisation systems can operate. An objective is that hyper-heuristics will lead to more general systems that are able to handle a wide range of problem domains rather than current meta-heuristic technology which tends to be customised to a particular problem or a narrow class of problems. Hyperheuristics are broadly concerned with intelligently choosing the right heuristic or algorithm in a given situation. Of course, a hyper-heuristic can be (often is) a (meta-)heuristic and it can operate on (meta-)heuristics. In a certain sense, a hyper-heuristic works at a higher level when compared with the typical application of meta-heuristics to optimisation problems i.e. a hyper-heuristic could be thought of as a (meta)-heuristic which operates on lower level (meta- )heuristics. In this chapter we will introduce the idea and give a brief history of this emerging area. In addition, we will review some of the latest work to be published in the field.
A Monte Carlo Hyper-Heuristic To Optimise Component Placement Sequencing For Multi Head Placement Machine
- PLACEMENT MACHINE, INTECH’03 THAILAND
, 2003
"... In this paper we introduce a Monte Carlo based hyper-heuristic. The Monte Carlo hyper-heuristic manages a set of low level heuristics (in this case just simple 2-opt swaps but they could be any other heuristics). Each of the low level heuristics is responsible for creating a unique neighbour that ..."
Abstract
-
Cited by 26 (7 self)
- Add to MetaCart
In this paper we introduce a Monte Carlo based hyper-heuristic. The Monte Carlo hyper-heuristic manages a set of low level heuristics (in this case just simple 2-opt swaps but they could be any other heuristics). Each of the low level heuristics is responsible for creating a unique neighbour that may be impossible to create by the other low level heuristics. On each iteration, the Monte Carlo hyper heuristic randomly calls a low level heuristic. The new solution returned by the low level heuristic will be accepted based on the Monte Carlo acceptance criteria. The Monte Carlo acceptance criteria always accept an improved solution. Worse solutions will be accepted with a certain probability, which decreases with worse solutions, in order to escape local minima. We develop three hyper-heuristics based on a Monte Carlo method, these being Linear Monte Carlo Exponential Monte Carlo and Exponential Monte Carlo with counter. We also investigate four other hyperheuristics to examine their performance and for comparative purposes. To demonstrate our approach we employ these hyper-heuristics to optimise component placement sequencing in order to improve the efficiency of the multi head placement machine. Experimental results show that the Exponential Monte Carlo hyperheuristic is superior to the other hyper-heuristics and is superior to a choice function hyper-heuristic reported in earlier work.
Distributed Choice Function Hyperheuristics for Timetabling and Scheduling
- Practice and Theory of Automated Timetabling V, Springer Lecture notes in Computer Science. Volume 3616. (2005) 51–67
, 2004
"... This paper reports on on-going research in the design of choice function hyperheuristics, the modelling of general-purpose low level heuristics, and the exploitation of parallel computing platforms for hyperheuristics ..."
Abstract
-
Cited by 16 (1 self)
- Add to MetaCart
This paper reports on on-going research in the design of choice function hyperheuristics, the modelling of general-purpose low level heuristics, and the exploitation of parallel computing platforms for hyperheuristics
Investigation of a Tabu Assisted Hyper-Heuristic Genetic Algorithm
- In proceedings of Congress on Evolutionary Computation(CEC2003
, 2003
"... Abstract-This paper investigates a tabu assisted genetic algorithm based hyper-heuristic (hyper-TGA) for personnel scheduling problems. We recently introduced a hyper-heuristic genetic algorithm (hyper-GA) with an adaptive length chromosome which aims to evolve an ordering of low-level heuristics in ..."
Abstract
-
Cited by 12 (4 self)
- Add to MetaCart
Abstract-This paper investigates a tabu assisted genetic algorithm based hyper-heuristic (hyper-TGA) for personnel scheduling problems. We recently introduced a hyper-heuristic genetic algorithm (hyper-GA) with an adaptive length chromosome which aims to evolve an ordering of low-level heuristics in order to find good quality solutions to given problems. The addition of a tabu method, the focus of this paper, extends that work. The aim of adding a tabu list to the hyper-GA is to indicate the efficiency of each gene within the chromosome. We apply the algorithm to a geographically distributed training staff and course scheduling problem and compare the computational results with our previous hyper-GA. 1.
An Adaptive Length Chromosome Hyperheuristic Genetic Algorithm for a Trainer Scheduling Problem
- Proceedings of the fourth Asia-Pacific Conference on Simulated Evolution And Learning, (SEAL'02), Orchid Country Club, Singapore, 18-22 Nov 2002
"... Hyper-GA was introduced by the authors as a genetic algorithm based hyperheuristic which aims to evolve an ordering of low-level heuristics so as to find a good quality solution to a given problem. The adaptive length chromosome hyper-GA, let's call it ALChyper-GA, is an extension of the authors pre ..."
Abstract
-
Cited by 11 (4 self)
- Add to MetaCart
Hyper-GA was introduced by the authors as a genetic algorithm based hyperheuristic which aims to evolve an ordering of low-level heuristics so as to find a good quality solution to a given problem. The adaptive length chromosome hyper-GA, let's call it ALChyper-GA, is an extension of the authors previous work, in which the chromosome was of fixed length. The aim of a variable length chromosome is two fold; 1) it allows dynamic removal and insertion of heuristics 2) it allows the GA to find a good chromosome length which could otherwise only be found by experimentation. We apply the ALChyper-GA to a geographically distributed training staff and courses scheduling problem, and report that good quality solution can be found. We also present results for four versions of the ALChyper-GA, applied to five test data sets.
Scheduling Nurses Using a Tabu-Search Hyperheuristic
- Proc. of the 1st MISTA
, 2003
"... Hyperheuristics can be defined to be heuristics which choose between heuristics in order to solve a given optimisation problem. A number of hyperheuristics have been developed over the past few years. Here we propose a new hyperheuristic framework within which heuristics compete against one another. ..."
Abstract
-
Cited by 11 (3 self)
- Add to MetaCart
Hyperheuristics can be defined to be heuristics which choose between heuristics in order to solve a given optimisation problem. A number of hyperheuristics have been developed over the past few years. Here we propose a new hyperheuristic framework within which heuristics compete against one another. The rules for competition are motivated by the principles of reinforcement learning. We analyse the differences between a previously published choice function hyperheuristic and the new hyperheuristic. We demonstrate how the new hyperheuristic can make further improvements when a number of features are incorporated, including a dynamic tabu list which forbids the use of certain heuristics at certain times. The result is an algorithm which is competitive with the choice function hyperheuristic when applied to a comprehensive suite of nurse scheduling problems at a major UK hospital, featuring a wide variety of solution landscapes.
An investigation of automated planograms using a simulated annealing based hyper-heuristics
- Progress as Real Problem Solver - (Operations Research/Computer Science Interface Serices, Vol.32
, 2005
"... 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 m ..."
Abstract
-
Cited by 10 (6 self)
- Add to MetaCart
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. hyper-heuristics, simulated annealing, shelf space allocation, planograms 1.
An Investigation of a Tabu Search Based Hyper-heuristic for Examination Timetabling
- PP 309–328. RBAIET AL—HEURISTIC, META-HEURISTIC AND HYPER-HEURISTIC APPROACHES 11 KOTZAN J AND EVANSON R
, 2005
"... This paper investigates a tabu search based hyper-heuristic for solving examination timetabling problems. The hyper-heuristic framework uses a tabu list to monitor the performance of a collection of low-level heuristics and then make tabu heuristics that have been applied too many times, thus allo ..."
Abstract
-
Cited by 9 (3 self)
- Add to MetaCart
This paper investigates a tabu search based hyper-heuristic for solving examination timetabling problems. The hyper-heuristic framework uses a tabu list to monitor the performance of a collection of low-level heuristics and then make tabu heuristics that have been applied too many times, thus allowing other heuristics to be applied. Experiments carried out on examination timetabling datasets from the literature show that this approach is able to produce good quality solutions.
Multi-Objective Hyper-Heuristic Approaches For Space Allocation And Timetabling
- Meta-heuristics: Progress as Real Problem Solvers
, 2003
"... An important issue in multi-objective optimisation is how to ensure that the obtained non-dominated set covers the Pareto front as widely as possible. A number of techniques (e.g. weight vectors, niching, clustering, cellular structures, etc.) have been proposed in the literature for this purpose. I ..."
Abstract
-
Cited by 8 (6 self)
- Add to MetaCart
An important issue in multi-objective optimisation is how to ensure that the obtained non-dominated set covers the Pareto front as widely as possible. A number of techniques (e.g. weight vectors, niching, clustering, cellular structures, etc.) have been proposed in the literature for this purpose. In this paper we propose a new approach to address this issue in multi-objective combinatorial optimisation. We explore hyperheuristics, a research area which has gained increasing interest in recent years. A hyper-heuristic can be thought of as a heuristic method which iteratively attempts to select a good heuristic amongst many. The aim of using a hyper-heuristic is to raise the level of generality so as to be able to apply the same solution method to several problems, perhaps at the expense of reduced but still acceptable solution quality when compared to a tailor-made approach. The key is not to solve the problem directly but rather to (iteratively) recommend a suitable heuristic chosen because of its performance. In this paper we investigate a tabu search hyper-heuristic technique. The idea of our multi-objective hyperheuristic approach is to choose at each iteration during the search, the heuristic that is suitable for the optimisation of a given individual objective. We test the resulting approach on two very di#erent real-world combinatorial optimisation problems: space allocation and timetabling. The results obtained show that the multi-objective hyper-heuristic approach can be successfully developed for these two problems producing solutions of acceptable quality.

