Recently, a new crossover technique for genetic algorithms has been proposed.The technique, called probabilistic adaptive crossover (PAX), includes the estimation of the probability distribution of the population, storing the information regarding the best and the worst solutions of the problem being solved in a probability vector. The use of the proposed technique to face Chilean wine classifi...

among various heuristics techniques, genetic algorithm (ga) is one of the most widely used techniques which has successfully been applied on a variety of complex combinatorial problems. the performance of ga largely depends on the proper selection of its parameters values; including crossover mechanism, probability of crossover, population size and mutation rate and selection percent. in this p...

In this paper a new general schema theory for genetic programming is presented. Like other recent GP schema theory results (Poli 2000a, Poli 2000b), the theory gives an exact formulation (rather than a lower bound) for the expected number of instances of a schema at the next generation. The theory is based on a Cartesian node reference system which makes it possible to describe programs as func...

This paper considers deception in the context of ordering genetic algorithms (GAs). Order-four deceptive ordering problems are designed for absolute and relative ordering decoding. Three different crossover operators are used in both absolute and relative ordering problems, and for each combination of crossover operator and coding, the schema survival probability is calculated. Simulation resul...

Recent experimental results about the formation of molecular hydrogen on astrophysically relevant surfaces under conditions close to those encountered in the interstellar medium are analyzed using rate equations. The parameters of the rate equation model are fitted to temperature-programmed desorption curves obtained in the laboratory. These parameters are the activation energy barriers for ato...

The survival probability of a particle diffusing in the two dimensional domain x > 0 near a " windy cliff " at x = 0 is investigated. The particle dies upon reaching the edge of the cliff. In addition to diffusion , the particle is influenced by a steady " wind shear " with velocity v(x, y) = v sign(y) ˆ x, i. e., no average bias either toward or away from the cliff. For this semi-infinite syst...

Having the constant population size and crossover/mutation probability, standard genetic algorithm (SGA) has such disadvantages as premature convergence, low stability and optimization efficiency for large design variables situation. This paper presents an improved adaptive genetic algorithm (IAGA), which adjusts the population size and the crossover/mutation probability adaptively and linearly...

I describe an analytical approximation for calculating the short-term probability of loss of a chromosome under the neutral Wright-Fisher model with recombination. I also present an upper and lower bound for this probability. Exact analytical calculation of this quantity is difficult and computationally expensive because the number of different ways in which a chromosome can be lost, grows very...