A Novel Genetic Algorithm for Global Optimization

This paper presents a novel genetic algorithm for globally solving un-constraint optimization problem. In this algorithm, a new real coded crossover operator is proposed firstly. Furthermore, for improving the convergence speed and the searching ability of our algorithm, the good point set theory rather than random selection is used to generate the initial population, and the chaotic search operator is adopted in the best solution of the current iteration. The experimental results tested on numerical benchmark functions show that this algorithm has excellent solution quality and convergence characteristics, and performs better than some algorithms.