The performance of the gene expression messy genetic algorithm on real test functions

The paper reports the performance of an experimental version of the recently introduced gene expression messy genetic algorithm (GEMGA) (H. Kargupta, 1996) for different classes of real test problems. A more recent version of GEMGA can be found elsewhere. The GEMGA has a strong computational and biological foundation. It emphasizes the role of gene expression in evolution and it searches for relations among genes using transcription like operators. The particular version of GEMGA used in this work is an O(A^k(l+k)) sample complexity algorithm for the class of order-k delineable problems (H. Kargupta, 1995) (problems that can be solved by considering no higher than order-k relations)