Probilistic adapting crossover (PAX): A novel genetic algorithm crossoer methodogy

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 compared with six crossover techniques namely: one-point crossover, two-point crossover, SANUX, discrete crossover, uniform crossover and selective crossover. These methodologies were simulated and compared over five test problems described by ONEMAX Function, Royal Road Function, Random L-MaxSAT, Bohachevsky Function, and the Himmelblau Function.