Convergence of Program Fitness Landscapes
نویسنده
چکیده
Point mutation has no effect on almost all linear programs. In two genetic programming (GP) computers (cyclic and bit flip) we calculate the fitness evaluations needed using steepest ascent and first ascent hill climbers and evolutionary search. We describe how the average fitness landscape scales with program length and give general bounds.
منابع مشابه
Fitness Costs of Mutation Rate Adaption and its Application to Optimization of Dynamic Objective Functions
Evolutionary algorithms can be used to solve complex optimization tasks. However, adequate parameterization is crucial for efficient optimization. Evolutionary adaptation of mutation rates provides a solution to the problem of finding suitable mutation rate settings. However, evolution of low mutation rates may lead to premature convergence. In nature, mutation rate control coevolves with other...
متن کاملConvergence Rates For The Distribution Of Program Outputs
Fitness distributions (landscapes) of programs tend to a limit as they get bigger. Markov chain convergence theorems give general upper bounds on the linear program sizes needed for convergence. Tight bounds (exponential in N , N logN and smaller) are given for five computer models (any, average, cyclic, bit flip and Boolean). Mutation randomizes a genetic algorithm population in 1 4 (l + 1)(lo...
متن کاملClustering-based hierarchical genetic algorithm for complex fitness landscapes
We propose the use of a hierarchical Genetic Algorithm (GA) for optimization in complex landscapes. While the slave GA tries to find local optima in the restricted fitness landscape of low complexity, the master GA tries to identify interesting regions in the entire landscape. The slave GA is a conventional GA with high convergence. The master GA is more exploratory in nature. This GA clusters ...
متن کاملFitness Landscapes
Fitness landscapes are a valuable concept in evolutionary biology, combinatorial optimization, and the physics of disordered systems. A fitness landscape is a mapping from a configuration space that is equipped with some notion of adjacency, nearness, distance or accessibility, into the real numbers. Landscape theory has emerged as an attempt to devise suitable mathematical structures for descr...
متن کاملAnalysis of NK-xor Landscapes
The NK-xor landscapes are a class of optimization problems with adjustable ruggedness of its fitness landscape. The optimal value for each of the loci is dependent upon a k-neighbourhood of this locus. A set of these landscapes is analyzed and the evolution of certain generic algorithms when applied to these fitness-landscapes is approximated by means of a transmision-function model. 1991 Mathe...
متن کامل