Jun He, Colin Reeves, Carsten Witt, Xin Yao
Various ways have been defined to measure the hardness of a fitness function for evolutionary algorithms and other black-box heuristics. Examples include fitness landscape analyses, epistasis,...
Crossover and Recombination: Isolating the Building Blocks of a Genetic Algorithm (2007)
In this paper, we focus on a description of genetic algorithms which relies on ideas from general neighbourhood search techniques. In order to apply these concepts, it is necessary to examine...
04081 Abstracts Collection -- Theory of Evolutionary Algorithms (2006)
Beyer, Hans-Georg, Jansen, Thomas, Reeves, Colin, Vose, Michael D.
From 15.02.04 to 20.02.04, the Dagstuhl Seminar 04081 ``Theory of Evolutionary Algorithms'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar,...
Partitioning a call graph (2005)
Bisseling, Rob H., Byrka, Jarosław, Cerav-Erbas, Selin, Gvozdenovíc, Nebojša, Lorenz, Mathias, Pendavingh, Rudi, ...
Splitting a large software system into smaller and more manageable units has become an important problem for many organizations. The basic structure of a software system is given by a directed graph...
Partitioning a call graph (2005)
Bisseling, Rob H., Byrka, Jarosław, Cerav-Erbas, Selin, Gvozdenovíc, Nebojša, Lorenz, Mathias, Pendavingh, Rudi, ...
Splitting a large software system into smaller and more manageable units has become an important problem for many organizations. The basic structure of a software system is given by a directed graph...
Partitioning a call graph (2005)
Rob H. Bisseling, Selin Cerav-erbas, Mathias Lorenz, Rudi Pendavingh, Colin Reeves, Matthias Röger, ...
In recent years, the capabilities of information technology have increased tremendously. At the same time, large software systems in today’s organizations
Conceptual master plan for Middlefork : Brown County, Indiana, July 14, 2001 / (2001)
Thesis (M.L.A.)--Ball State University, 2001.
Genetic Algorithms, Path Relinking and the Flowshop Sequencing Problem (1998)
In a previous paper (Reeves, 1995), a simple genetic algorithm (GA) was developed for finding (approximately) the minimum makespan of the n-job, m-machine permutation flowshop sequencing problem...
Permutation Flowshop Scheduling by Genetic Local Search (1997)
In this paper, the landscape for the permutation flowshop scheduling problem (PFSP) with stochastic local search and a critical block-based neighbourhood structure has been investigated. Numerical...
The Crossover Landscape for the Onemax Problem (1996)
In seeking to understand how and why genetic algorithms (GAs) work, attention has been focussed on the landscapes on which they search. While it is relatively simple to analyse the landscapes induced...
An Experimental Design Perspective on Genetic Algorithms (1995)
Colin Reeves And, Colin Reeves, Christine Wright
In this paper we examine the relationship between genetic algorithms (GAs) and traditional methods of experimental design. This was motivated by an investigation into the problem caused by epistasis...
Integrating Local Search into Genetic Algorithms (1995)
Genetic algorithms (GAs) have proved to be a versatile and effective approach for solving combinatorial optimization problems. Nevertheless, there are many situations in which the simple GA does not...
An Experimental Design Perspective on Genetic Algorithms (1995)
Colin Reeves, Christine Wright
In this paper we examine the relationship between genetic algorithms (GAs) and traditional methods of experimental design. This was motivated by an investigation into the problem caused by epistasis...
Genetic Algorithms and Neighbourhood Search (1994)
Genetic algorithms (GAs) have proved to be a versatile and effective approach for solving combinatorial optimization problems. Nevertheless, there are many situations in which the simple GA does not...
Hybrid Genetic Algorithms for Bin-packing and Related Problems (1993)
The genetic algorithm (GA) paradigm has attracted considerable attention as a promising heuristic approach for solving optimization problems. Much of the development has related to problems of...