Results 1  10
of
122
A Classification of Hyperheuristic Approaches
"... The current state of the art in hyperheuristic research comprises a set of approaches that share the common goal of automating the design and adaptation of heuristic methods to solve hard computational search problems. The main goal is to produce more generally applicable search methodologies. In ..."
Abstract

Cited by 58 (21 self)
 Add to MetaCart
(Show Context)
The current state of the art in hyperheuristic research comprises a set of approaches that share the common goal of automating the design and adaptation of heuristic methods to solve hard computational search problems. The main goal is to produce more generally applicable search methodologies. In this chapter we present and overview of previous categorisations of hyperheuristics and provide a unified classification and definition which captures the work that is being undertaken in this field. We distinguish between two main hyperheuristic categories: heuristic selection and heuristic generation. Some representative examples of each category are discussed in detail. Our goal is to both clarify the main features of existing techniques and to suggest new directions for hyperheuristic research.
Computational models and heuristic methods for Grid scheduling problems
 FUTURE GENERATION COMPUTER SYSTEMS
, 2010
"... ..."
Evolving Bin Packing Heuristics with Genetic Programming
 PARALLEL PROBLEM SOLVING FROM NATURE  PPSN IX SPRINGER LECTURE NOTES IN COMPUTER SCIENCE. VOLUME 4193 OF LNCS., REYKJAVIK, ICELAND, SPRINGERVERLAG (2006) 860–869
, 2006
"... The binpacking problem is a well known NPHard optimisation problem, and, over the years, many heuristics have been developed to generate good quality solutions. This paper outlines a genetic programming system which evolves a heuristic that decides whether to put a piece in a bin when presente ..."
Abstract

Cited by 38 (13 self)
 Add to MetaCart
The binpacking problem is a well known NPHard optimisation problem, and, over the years, many heuristics have been developed to generate good quality solutions. This paper outlines a genetic programming system which evolves a heuristic that decides whether to put a piece in a bin when presented with the sum of the pieces already in the bin and the size of the piece that is about to be packed. This heuristic operates in a fixed framework that iterates through the open bins, applying the heuristic to each one, before deciding which bin to use. The best evolved programs emulate the functionality of the human designed `firstfit' heuristic. Thus, the contribution of this paper is to demonstrate that genetic programming can be employed to automatically evolve bin packing heuristics which are the same as high quality heuristics which have been designed by humans.
A Monte Carlo HyperHeuristic 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 hyperheuristic. The Monte Carlo hyperheuristic manages a set of low level heuristics (in this case just simple 2opt 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 38 (12 self)
 Add to MetaCart
In this paper we introduce a Monte Carlo based hyperheuristic. The Monte Carlo hyperheuristic manages a set of low level heuristics (in this case just simple 2opt 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 hyperheuristics 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 hyperheuristics 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 hyperheuristics and is superior to a choice function hyperheuristic reported in earlier work.
Automatic heuristic generation with genetic programming: Evolving a jackofalltrades or a master of one
 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, GECCO 2007, PROCEEDINGS
, 2007
"... It is possible to argue that online bin packing heuristics should be evaluated by using metrics based on their performance over the set of all bin packing problems, such as the worst case or average case performance. However, this method of assessing a heuristic would only be relevant to a user who ..."
Abstract

Cited by 37 (14 self)
 Add to MetaCart
(Show Context)
It is possible to argue that online bin packing heuristics should be evaluated by using metrics based on their performance over the set of all bin packing problems, such as the worst case or average case performance. However, this method of assessing a heuristic would only be relevant to a user who employs the heuristic over a set of problems which is actually representative of the set of all possible bin packing problems. On the other hand, a real world user will often only deal with packing problems that are representative of a particular subset. Their piece sizes will all belong to a particular distribution. The contribution of this paper is to show that a Genetic Programming system can automate the process of heuristic generation and produce heuristics that are humancompetitive over a range of sets of problems, or which excel on a particular subset. We also show that the choice of training instances is vital in the area of automatic heuristic generation, due to the tradeoff between the performance and generality of the heuristics generated and their applicability to new problems.
Exploring Hyperheuristic Methodologies with Genetic Programming
"... Hyperheuristics represent a novel search methodology that is motivated by the goal of automating the process of selecting or combining simpler heuristics in order to solve hard computational search problems. An extension of the original hyperheuristic idea is to generate new heuristics which are n ..."
Abstract

Cited by 34 (14 self)
 Add to MetaCart
(Show Context)
Hyperheuristics represent a novel search methodology that is motivated by the goal of automating the process of selecting or combining simpler heuristics in order to solve hard computational search problems. An extension of the original hyperheuristic idea is to generate new heuristics which are not currently known. These approaches operate on a search space of heuristics rather than directly on a search space of solutions to the underlying problem which is the case with most metaheuristics implementations. In the majority of hyperheuristic studies so far, a framework is provided with a set of human designed heuristics, taken from the literature, and with good measures of performance in practice. A less well studied approach aims to generate new heuristics from a set of potential heuristic components. The purpose of this chapter is to discuss this class of hyperheuristics, in which Genetic Programming is the most widely used methodology. A detailed discussion is presented including the steps needed to apply this technique, some representative case studies, a literature review of related work, and a discussion of relevant issues. Our aim is to convey the exciting potential of this innovative approach for automating the heuristic design process
CaseBased Heuristic Selection for Timetabling Problems
, 2003
"... This paper presents a casebased heuristic selection approach for automated university course and exam timetabling. The method described in this paper is motivated by the goal of developing timetabling systems that are fundamentally more general than the current state of the art. Heuristics that wor ..."
Abstract

Cited by 25 (10 self)
 Add to MetaCart
This paper presents a casebased heuristic selection approach for automated university course and exam timetabling. The method described in this paper is motivated by the goal of developing timetabling systems that are fundamentally more general than the current state of the art. Heuristics that worked well in previous similar situations are memorized in a case base and are retrieved for solving the new problem in hand. Knowledge discovery techniques are employed in two distinct scenarios. Firstly, we model the problem and the problem solving situations along with specific heuristics for those problems. Secondly, we refine the case base and discard cases which prove to be nonuseful in solving new problems. Experimental results are presented and analyzed. It is shown that case based reasoning can act effectively as an intelligent approach to learn which heuristics work well for particular timetabling situations. We conclude by outlining and discussing potential research issues in this area of knowledge discovery for different difficult timetabling problems
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 ongoing research in the design of choice function hyperheuristics, the modelling of generalpurpose low level heuristics, and the exploitation of parallel computing platforms for hyperheuristics ..."
Abstract

Cited by 23 (1 self)
 Add to MetaCart
(Show Context)
This paper reports on ongoing research in the design of choice function hyperheuristics, the modelling of generalpurpose low level heuristics, and the exploitation of parallel computing platforms for hyperheuristics
A Genetic Programming HyperHeuristic Approach for Evolving Two Dimensional Strip Packing Heuristics
"... We present a genetic programming system to evolve reusable heuristics for the two dimensional strip packing problem. The evolved heuristics are constructive, and decide both which piece to pack next and where to place that piece, given the current partial solution. This work contributes to a growing ..."
Abstract

Cited by 21 (9 self)
 Add to MetaCart
We present a genetic programming system to evolve reusable heuristics for the two dimensional strip packing problem. The evolved heuristics are constructive, and decide both which piece to pack next and where to place that piece, given the current partial solution. This work contributes to a growing research area which represents a paradigm shift in search methodologies. Instead of using evolutionary computation to search a space of solutions, we employ it to search a space of heuristics for the problem. One of the motivations for this research area is that once a heuristic has been evolved, it can be reused on any new problem instance, meaning that the time consuming evolutionary process need only be run once to obtain a solution to many problem instances. A second motivation is to research methods to automate the heuristic design process. It has been stated in the literature that humans are very good at identifying good building blocks for solution methods, however the task of intelligently searching through all of the potential combinations of these components may be better suited to a computer. With such tools at their disposal, heuristic designers are then free to commit more of their time to the creative process of determining good components, while the computer takes on some of the design process by intelligently combining these components. The contribution of this paper is to show that a genetic programming hyperheuristic can be employed to automatically generate heuristics which are often better than the humandesigned state of the art constructive heuristics, in a very well studied area.
Iterated local search vs. hyperheuristics: Towards generalpurpose search algorithms
 In IEEE Congress on Evolutionary Computation (CEC 2010
, 2010
"... Abstract — An important challenge within hyperheuristic research is to design search methodologies that work well, not only across different instances of the same problem, but also across different problem domains. This article conducts an empirical study involving three different domains in combin ..."
Abstract

Cited by 20 (8 self)
 Add to MetaCart
(Show Context)
Abstract — An important challenge within hyperheuristic research is to design search methodologies that work well, not only across different instances of the same problem, but also across different problem domains. This article conducts an empirical study involving three different domains in combinatorial optimisation: bin packing, permutation flow shop and personnel scheduling. Using a common software interface (HyFlex), the same algorithms (highlevel strategies or hyperheuristics) can be readily run on all of them. The study is intended as a proof of concept of the proposed interface and domain modules, as a benchmark for testing the generalisation abilities of heuristic search algorithms. Several algorithms and variants from the literature were implemented and tested. From them, the implementation of iterated local search produced the best overall performance. Interestingly, this is one of the most conceptually simple competing algorithms, its advantage as a robust algorithm is probably due to two factors: (i) the simple yet powerful exploration/exploitation balance achieved by systematically combining a perturbation followed by local search; and (ii) its parameterless nature. We believe that the challenge is still open for the design of robust algorithms that can learn and adapt to the available lowlevel heuristics, and thus select and apply them accordingly. I.