Title :
The Gene Expression Messy Genetic Algorithm
Author :
Kargupta, Hillol
Author_Institution :
Comput. Sci. Methods Group, Los Alamos Nat. Lab., NM, USA
Abstract :
Introduces the Gene Expression Messy Genetic Algorithm (GEMGA)-a new generation of messy genetic algorithms that directly search for relations among the members of the search space. GEMGA is an O[Λ k(l2+k)] sample complexity algorithm for the class of order-k delineable problems (problems that can be solved by considering no higher than order-k relations). GEMGA is designed based on an alternate perspective of natural evolution, as proposed by the SEARCH (Search Envisioned As Relation and Class Hierarchizing) framework, that emphasizes the role of gene expression. GEMGA uses the transcription operator to search for relations. This paper also presents test results of the GEMGA for large multimodal order-k delineable problems
Keywords :
computational complexity; genetic algorithms; search problems; GEMGA; Gene Expression Messy Genetic Algorithm; SEARCH framework; class hierarchizing; large multimodal order-k delineable problems; natural evolution; order-k relations; relation hierarchizing; relation searching; sample complexity; transcription operator; Biological cells; Couplings; Data structures; Decision making; Evolutionary computation; Gene expression; Genetic algorithms; Laboratories; Polynomials; Testing;
Conference_Titel :
Evolutionary Computation, 1996., Proceedings of IEEE International Conference on
Conference_Location :
Nagoya
Print_ISBN :
0-7803-2902-3
DOI :
10.1109/ICEC.1996.542706
