An Improved Genetic Algorithm Based on hJ1 Subdivision and Fixed Point

Abstract:

Article Preview

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.

Info:

Periodical:

Edited by:

Yuhang Yang, Xilong Qu, Yiping Luo and Aimin Yang

Pages:

101-105

DOI:

10.4028/www.scientific.net/AMR.216.101

Citation:

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

Online since:

March 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.