Like other learning paradigms, the performance of the genetic algorithms (GAs) is dependent on the parameter choice, on the problem representation, and on the fitness landscape. Accordingly, a GA can show good or weak results even when applied on the same problem. Following this idea, the crossover operator plays an important role, and its study is the object of the present paper. A mathematica...

The dynamics of a genetic algorithm undergoing ranking selection, mutation, and two-point crossover for the ones-counting problem is studied using a statistical mechanics approach. This approach has been used previously to study this problem, but with uniform crossover. Two-point crossover induces additional linkage between nearby loci which changes the dynamics significantly. To account for th...

The success of the application of evolutionary approaches depends, to a large extent, on problem representation and on the used genetic operators. In this paper we introduce a new graph based crossover operator and compare it with classical two-point crossover. The study was carried out using a theoretical hard problem known as Busy Beaver. This problem involves the search for the Turing Machin...

Introduction: Although chronic ankle instability (CAI) is a condition characterized by numerous ankle sprains and the recurring sensation of ankle instability, which result in activity limitations and participation restrictions. Repetition based balance training protocols on type of the balance exercises may improve the deficits often associated with CAI. The objective of this study was to dete...

At finite temperature we study the quantum tunneling of magnetization for a small ferromagnetic particle with the biaxial symmetry placed in a magnetic field at an arbitrary angle. We present numerical WKB exponent below the crossover temperature in which the quantum tunneling is affected by the thermal activation, and the approximate form of the WKB exponent around the crossover region. The ef...

This paper presents a study of the effectiveness of a recently presented crossover operator for the GAuGE system. This crossover, unlike the traditional crossover employed previously, preserves the association of positions and values which exists in GAuGE genotype strings, and as such is more adequate for problems where the meaning of an allele is dependent on its placement in the phenotype str...

Whereas there are hundreds of known iron(II) spin-crossover compounds, only a handful of cobalt(II) spin-crossover compounds have been discovered to date, and hardly an in depth study on any of them exists. This review begins with an introduction into the theoretical aspects to be considered when discussing spin-crossover compounds in general and cobalt(II) systems in particular. It is followed...

In genetic algorithms, commonly used crossover operators such as one-point, two-point and uniform crossover operator are likely to destroy the information obtained in the evolution because of their random choices of crossover points. To overcome this defect, a new adaptive crossover operator based on the Rough Set theory is proposed in this paper. By using this specialized crossover operator, u...

In recent theoretical and experimental work on schemata in genetic programming we have proposed a new simpler form of crossover in which the same crossover point is selected in both parent programs. We call this operator one-point crossover because of its similarity with the corresponding operator in genetic algorithms. One point crossover presents very interesting properties from the theory po...

A new crossover technique for genetic algorithms is proposed in this paper. The technique is called probabilistic adaptive crossover and denoted by PAX. The method includes the estimation of the probability distribution of the population, in order to store in a unique probability vector P information about the best and the worse solutions of the problem to be solved. The proposed methodology is...