A Parallel Search Genetic Algorithm Based on Multiple Peak Values and Multiple Rules

In this paper the Hamming distance is used to contr ol individual difference in the process of creating an original population, and a peak-depot is established to preserve information of different peak-points. So me new methods are also put forward to improve optimization performance of genet ic algorithm, such as point-cast method and neighborhood search strategy around peak-points. The methods are used to deal with genetic operation besides of cr ossover and mutation, in order to obtain a global optimum solution and avoid GA ’s premature convergence. By means of many control rules and a peak-depot, the new algorithm carries out optimum search surrounding several peak-points. Alon g with evolution of individuals of population, the fitness of peak-points of pe ak-depot increases continually, and a global optimum solution can be obtained. The new algorithm searches around several peak-points, which increases the prob ability to obtain the global optimum solution to the best. By using some example s to test the modified genetic algorithm, the results indicate what we have done makes the modified genetic algorithm effectively to solve both of linear optimi zation problems and nonlinear optimization problems with restrictive functions.

In this paper the Hamming distance is used to contr ol individual difference in the process of creating an original population, and a peak-depot is established to preserve information of different peak-points. So me new methods are also put forward to improve optimization performance of genet ic algorithm, such as point-cast method and neighborhood search strategy around peak-points. The methods are used to deal with genetic operation besides of cr ossover and mutation, in order to obtain a global optimu...