1,303 research outputs found

    Towards the Design of Heuristics by Means of Self-Assembly

    Get PDF
    The current investigations on hyper-heuristics design have sprung up in two different flavours: heuristics that choose heuristics and heuristics that generate heuristics. In the latter, the goal is to develop a problem-domain independent strategy to automatically generate a good performing heuristic for the problem at hand. This can be done, for example, by automatically selecting and combining different low-level heuristics into a problem specific and effective strategy. Hyper-heuristics raise the level of generality on automated problem solving by attempting to select and/or generate tailored heuristics for the problem at hand. Some approaches like genetic programming have been proposed for this. In this paper, we explore an elegant nature-inspired alternative based on self-assembly construction processes, in which structures emerge out of local interactions between autonomous components. This idea arises from previous works in which computational models of self-assembly were subject to evolutionary design in order to perform the automatic construction of user-defined structures. Then, the aim of this paper is to present a novel methodology for the automated design of heuristics by means of self-assembly

    Selection hyper-heuristics for healthcare scheduling

    Get PDF
    A variety of approaches have been used to solve a variety of combinatorial optimisation problems. Many of those approaches are tailored to the particular problem being addressed. Recently, there has been a growing number of studies towards providing more general search methodologies than currently exist which are applicable to different problem domains without requiring any algorithmic modification. Hyper-heuristics represent a class of such general methodologies which are capable of automating the design of search process via generating new heuristics and/or mixing existing heuristics to solve hard computational problems. This study focuses on the design of selection hyper-heuristics which attempt to improve an initially created solution iteratively through heuristic selection and move acceptance processes and their application to the real-world healthcare scheduling problems, particularly, nurse rostering and surgery admission planning. One of the top previously proposed general hyper-heuristic methodology was an adaptive hyper-heuristic consisting of many parameters, although their values were either fixed or set during the search process, with a complicated design. This approach ranked the first at an international cross-domain heuristic search challenge among twenty other competitors for solving instances from six different problem domains, including maximum satisfiability, one dimensional bin packing, permutation flow shop, personnel scheduling, travelling salesman, vehicle routing problems. The hyper-heuristics submitted to the competition along with the problem domain implementations can now be considered as the benchmark for hyper-heuristics. This thesis describes two new easy-to-implement selection hyper-heuristics and their variants based on iterated and greedy search strategies. A crucial feature of the proposed hyper-heuristics is that they necessitate setting of less number of parameters when compared to many of the existing approaches. This entails an easier and more efficient implementation, since less time and effort is required for parameter tuning. The empirical results show that our most efficient and effective hyper-heuristic which contains only a single parameter outperforms the top ranking algorithm from the challenge when evaluated across all six problem domains. Moreover, experiments using additional nurse rostering problems which are different than the ones used in the challenge and surgery scheduling problems show that the results found by the proposed hyper-heuristics are very competitive, yielding with the best known solutions in some cases

    Automating the packing heuristic design process with genetic programming

    Get PDF
    The literature shows that one-, two-, and three-dimensional bin packing and knapsack packing are difficult problems in operational research. Many techniques, including exact, heuristic, and metaheuristic approaches, have been investigated to solve these problems and it is often not clear which method to use when presented with a new instance. This paper presents an approach which is motivated by the goal of building computer systems which can design heuristic methods. The overall aim is to explore the possibilities for automating the heuristic design process. We present a genetic programming system to automatically generate a good quality heuristic for each instance. It is not necessary to change the methodology depending on the problem type (one-, two-, or three-dimensional knapsack and bin packing problems), and it therefore has a level of generality unmatched by other systems in the literature. We carry out an extensive suite of experiments and compare with the best human designed heuristics in the literature. Note that our heuristic design methodology uses the same parameters for all the experiments. The contribution of this paper is to present a more general packing methodology than those currently available, and to show that, by using this methodology, it is possible for a computer system to design heuristics which are competitive with the human designed heuristics from the literature. This represents the first packing algorithm in the literature able to claim human competitive results in such a wide variety of packing domains

    A Classification of Hyper-heuristic Approaches

    Get PDF
    The current state of the art in hyper-heuristic 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 hyper-heuristics and provide a unified classification and definition which captures the work that is being undertaken in this field. We distinguish between two main hyper-heuristic 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 hyper-heuristic research

    The automatic design of hyper-heuristic framework with gene expression programming for combinatorial optimization problems

    Get PDF
    Hyper-heuristic approaches aim to automate heuristic design in order to solve multiple problems instead of designing tailor-made methodologies for individual problems. Hyper-heuristics accomplish this through a high level heuristic (heuristic selection mechanism and an acceptance criterion). This automates heuristic selection, deciding whether to accept or reject the returned solution. The fact that different problems or even instances, have different landscape structures and complexity, the design of efficient high level heuristics can have a dramatic impact on hyper-heuristic performance. In this work, instead of using human knowledge to design the high level heuristic, we propose a gene expression programming algorithm to automatically generate, during the instance solving process, the high level heuristic of the hyper-heuristic framework. The generated heuristic takes information (such as the quality of the generated solution and the improvement made) from the current problem state as input and decides which low level heuristic should be selected and the acceptance or rejection of the resultant solution. The benefit of this framework is the ability to generate, for each instance, different high level heuristics during the problem solving process. Furthermore, in order to maintain solution diversity, we utilize a memory mechanism which contains a population of both high quality and diverse solutions that is updated during the problem solving process. The generality of the proposed hyper-heuristic is validated against six well known combinatorial optimization problem, with very different landscapes, provided by the HyFlex software. Empirical results comparing the proposed hyper-heuristic with state of the art hyper-heuristics, conclude that the proposed hyper-heuristic generalizes well across all domains and achieves competitive, if not superior, results for several instances on all domains

    CHAMP: Creating Heuristics via Many Parameters for online bin packing

    Get PDF
    The online bin packing problem is a well-known bin packing variant which requires immediate decisions to be made for the placement of a lengthy sequence of arriving items of various sizes one at a time into fixed capacity bins without any overflow. The overall goal is maximising the average bin fullness. We investigate a ‘policy matrix’ representation which assigns a score for each decision option independently and the option with the highest value is chosen for one dimensional online bin packing. A policy matrix might also be considered as a heuristic with many parameters, where each parameter value is a score. We hence investigate a framework which can be used for creating heuristics via many parameters. The proposed framework combines a Genetic Algorithm optimiser, which searches the space of heuristics in policy matrix form, and an online bin packing simulator, which acts as the evaluation function. The empirical results indicate the success of the proposed approach, providing the best solutions for almost all item sequence generators used during the experiments. We also present a novel fitness landscape analysis on the search space of policies. This study hence gives evidence of the potential for automated discovery by intelligent systems of powerful heuristics for online problems; reducing the need for expensive use of human expertise
    • …
    corecore