This paper revisits the classical Polynomial Mutation (PLM) operator and proposes a new probe guided version of the PLM operator designed to be used in conjunction with Multiobjective Evolutionary Algorithms (MOEAs). The proposed Probe Guided Mutation (PGM) operator is validated by using data sets from six different stock markets. The performance of the proposed PGM operator is assessed in comp...

We study an infinite population model for the genetic algorithm, where the iteration of the algorithm corresponds to an iteration of a map G. The map G is a composition of a selection operator and a mixing operator, where the latter models effects of both mutation and crossover. We examine the hyperbolicity of fixed points of this model. We show that for a typical mixing operator all the fixed ...

This article introduce the genetic algorithm to solve the routing problem with QoS requirements, solve the traditional routing algorithms in completely the limitation of the NP problem. QoS routing optimization model is given, and the detailed design of genetic algorithm encoding scheme, fitness function, selection operator, crossover operator and mutation operator. Finally, the simulation expe...

Inspired by the evolutionary strategy and the biological DNA mechanism, a hybrid DNA based genetic algorithm (HDNA-GA) with the population update operation and the adaptive parameter scope operation is proposed for solving parameter estimation problems of dynamic systems. The HDNA-GA adopts the nucleotides based coding and some molecular operations. In HDNA-GA, three new crossover operators, re...

Maintaining the genetic diversity in populations is an important issue when dealing with dynamic environments. In this paper we use a modified Genetic Algorithm (GA) to solve the 0/1 Dynamic Knapsack Problem (DKP). The proposed GA uses a biologically inspired genetic operator instead of the classical crossover operator. The proposed genetic operator is capable of maintaining the genetic variati...

This work analyzes fitness landscapes for the image filter design problem approached using functional-level Cartesian Genetic Programming. Smoothness and ruggedness of fitness landscapes are investigated for five genetic operators. It is shown that the mutation operator and the single-point crossover operator generate the smoothest landscapes and thus they are useful for practical applications ...

Traditional investigations with evolutionary programming (EP) for continuous parameter optimization problems have used a single mutation operator with a parameterized probability density function (pdf), typically a Gaussian. Using a variety of mutation operators that can be combined during evolution to generate pdf’s of varying shapes could hold the potential for producing better solutions with...

The appropriate choice of the genotype ! phenotype mapping in combination with the mutation operator is important for a successful evolutionary search process. We suggest a measure to quantify the quality of this combination by addressing the question whether the relation among distances is carried over from one space to the other. Search processes which do not destroy the neighbourhood structu...

Backtracking search algorithm is a novel population-based stochastic technique. This paper proposes an improved backtracking search algorithm for constrained optimization problems. The proposed algorithm is combined with differential evolution algorithm and the breeder genetic algorithm mutation operator. The differential evolution algorithm is used to accelerate convergence at later iteration ...

Evaluating a global optimal point in many global optimization problems in large space is required to more calculations. In this paper, there is presented a new approach for the continuous functions optimization with rotational mutation and crossover operator. This proposed method (RMC) starts from the point which has best fitness value by elitism mechanism and after that rotational mutation and...