An Improved Genetic Algorithm Based on hJ1 Subdivision and Fixed Point
An improved genetic algorithm based on hJ1 subdivision is proposed for multimodal optimization problems. With this algorithm, the optimal problems converse to solution of fixed point problems. In this case, whether every individual of the population is a completely labeled simplex can be used as an objective convergence criterion and determined whether the algorithm will be terminated. Finally, a function is used to demonstrate the effectiveness of the algorithm through solving the minimum points distinguished by using the Hessian Matrix.
Yuhang Yang, Xilong Qu, Yiping Luo and Aimin Yang
J. J. Zhang et al., "An Improved Genetic Algorithm Based on hJ1 Subdivision and Fixed Point", Advanced Materials Research, Vol. 216, pp. 101-105, 2011