An Improved Genetic Algorithm Based on K2(m) Triangulation of Continuous Self-Mapping

Article Preview

Abstract:

In this paper an improved genetic algorithm based on the simplex self-mapping fixed point algorithm is proposed. With this algorithm, the optimal problem of n-dimensional closure function will be transformed as the solution of approximate fixed point problem of n-dimensional standard simplexes by homeomorphism mapping. The genetic operators relying on the integer labels are designed. In this case, whether every individual loading simplex of the population is a completely labeled simplex can be used as an objective convergence criterion. The simulation results demonstrate that the proposed algorithm is valid and effective.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 295-297)

Pages:

2515-2520

Citation:

Online since:

July 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] R.A. Wehage and N.C. Barman: Design Sensitivity Analysis of Planar Mechanism and Machine Dynamics, ASME J. Mech, Des. , (1981), 103, P. 560-570

DOI: 10.1115/1.3254955

Google Scholar

[2] J. Holland: Adoptation in Natural and Artificial Systems [M], University of Michigan Press, (1992), P. 44~50

Google Scholar

[3] Yanling Gao and Juan Yao: Journal of Henan Mechanical and Electrical Engineering College, Vol.12(2004), P. 55 (In Chinese)

Google Scholar

[4] Huafen Yang: Journal of Chongqing Technology and Business University :Natural Science Edition, Vol.26(2009), P.148~151 (In Chinese)

Google Scholar

[5] Zeke Wang: Simplicial Fixed Points Algorithm. National University of Defense Technology Press, (1993) (In Chinese)

Google Scholar

[6] Yingjie Lei, Shanwen Zhang, Xuwu Li and Chuangming Zhou: MATLAB Genetic Algorithm Toolbox and its Application, Xi'an Electronic Sience &Technology University Press ,(2005) (In Chinese)

Google Scholar