We present evidence indicating that adding a crossover island greatly improves the performance of a Dynamic Island Model for Adaptive Operator Selection. Two combinatorial optimisation problems are considered: the Onemax benchmark, to prove the concept; and a real-world formulation of the course timetabling problem to test practical relevance. Crossover is added to the recently proposed dynamic...

The investigation of genetic and evolutionary algorithms on Ising model problems gives much insight into how these algorithms work as adaptation schemes. The onedimensional Ising model with periodic boundary conditions has been considered as a typical example with a clear building block structure suited well for two-point crossover. It has been claimed that GAs based on recombination and approp...

Exploration of the search space occurs at the cost of destructing existing good solutions. This cost will grow as the search progresses. The parametric uniform crossover is a general form of the uniform crossover operator. Using this operator, it would be possible to control the swapping probability of each locus. An adaptive method proposed that control the value of the exchange probability of...

After decades of success, research on evolutionary algorithms aims at developing a sound theory that describes and predict the behavior of these algorithms. One research topic of interest is the analysis of the role of crossover and recombination in genetic algorithms, especially since various papers come to diierent conclusions. The goals of this paper are to revisit some well-known concepts a...

In certain organisms, numbers of crossover events for any single chromosome are limited ("crossover interference") so that double crossover events are obtained at much lower frequencies than would be expected from the simple product of independent single-crossover events. We present a number of observations during which we examined interference over a large region of Caenorhabditis elegans chro...

Geometric crossover is a representation-independent generalization of the traditional crossover defined using the distance of the solution space. By choosing a distance firmly rooted in the syntax of the solution representation as basis for geometric crossover, one can design new crossovers for any representation. In previous work we have applied geometric crossover to simple permutations. In t...

This paper identifies the limitations of conventional crossover in genetic algorithms when operating on two chromosomes of differing lengths. To address these problems, the concept of a Semantic Hierarchy (i.e. tree of meaning) of a genotype within a genetic algorithm is introduced. With this in mind, a new form of crossover operator known as Hierarchical Crossover is presented, capable of perf...

Genetic algorithms are optimisation algorithms and mimic the natural process of evolution. Important operators used in genetic algorithms are selection, crossover and mutation. Selection operator is used to select the individuals from a population to create a mating pool which will participate in reproduction process. Crossover and mutation operators are used to introduce diversity in the popul...

Starting from a mathematical reinterpretation of the classical crossover operator, a new type of crossover is introduced. The proposed new crossover operator gives better performances than the classical 1 point, 2 point or uniform crossover operators. In the paper a theorical investigation of the behaviour of the new crossover is presented. In comparison to the classical crossover operator, it ...

What is crossover interference? During prophase of meiosis in most eukaryotes, DNA recombination events between homologous chromosomes are induced to occur at high frequency, so there are usually multiple events per chromosome pair per meiosis. Whereas many of these recombination events are non-reciprocal, a subset results in reciprocal exchange of genetic material between chromosomes — crossov...