In a series of papers [3-8], Daida et. al. highlighted the difficulties posed to Genetic Programming (GP) by the complexity of the structural search space, and attributed the probl...
Barrier trees are a convenient way of representing the structure of complex combinatorial landscapes over graphs. Here we generalize the concept of barrier trees to landscapes deļ...
Abstract. In this paper, we discuss an approach to an operator scheduling problem in a large organization over time with the aim of maintaining service quality and reducing total l...
A genetic algorithm is invariant with respect to a set of representations if it runs the same no matter which of the representations is used. We formalize this concept mathematica...
Jonathan E. Rowe, Michael D. Vose, Alden H. Wright
In a standard genetic algorithm (GA), individuals reproduce asexually: any two organisms may be parents in crossover. Gender separation and sexual selection here inspire a model o...