DocumentCode
289756
Title
Genetic strategy with gate change function
Author
Meng, Qing-chun ; Hamam, Y.
Author_Institution
ESIEE, Noisy-le-Grande, France
fYear
1993
fDate
17-20 Oct 1993
Firstpage
462
Abstract
In this paper, a new genetic strategy is presented for optimizing multimodal functions with an arbitrary distribution of solutions. In this algorithm, a gate change function (GCF) is developed to aid in constructing a subparent space. Based on the use of GCF and the cooperation between parents and subparents, the strategy leads to an efficient solution of the problem. The simulation results, given in this paper, show that this algorithm finds all the solutions of a problem with less computation time than that of simple genetic algorithms
Keywords
genetic algorithms; polynomials; gate change function; genetic algorithms; genetic strategy; multimodal functions; Computational modeling; Genetic algorithms; Genetic mutations; Polynomials; Tellurium;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems, Man and Cybernetics, 1993. 'Systems Engineering in the Service of Humans', Conference Proceedings., International Conference on
Conference_Location
Le Touquet
Print_ISBN
0-7803-0911-1
Type
conf
DOI
10.1109/ICSMC.1993.384915
Filename
384915
Link To Document