p.2496
p.2501
p.2506
p.2511
p.2515
p.2521
p.2526
p.2531
p.2534
An Improved Genetic Algorithm Based on K2(m) Triangulation of Continuous Self-Mapping
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.
Info:
Periodical:
Pages:
2515-2520
Citation:
Online since:
July 2011
Authors:
Price:
Сopyright:
© 2011 Trans Tech Publications Ltd. All Rights Reserved
Share:
Citation: