Compressed introns in a linkage learning genetic algorithm

Lobo, Fernando G. ; Deb, Kalyanmoy ; Goldberg, David E. ; Harik, Georges R. ; Wang, Liwei (1998) Compressed introns in a linkage learning genetic algorithm Symposium on Genetic Algorithms, (Madison, USA), San Mateo: Morgan Kaufmann . pp. 551-558.

[img]
Preview
PDF - Author Version
259kB

Official URL: http://citeseerx.ist.psu.edu/viewdoc/download?doi=...

Abstract

Over the last 10 years, many efforts have been made to design a competent genetic algorithm. This paper revisits and extends the latest of such efforts-the linkage learning genetic algorithm. Specifically, it introduces an efficient mechanism for representing the non-coding material. Recent investigations suggest that this new method is crucial for solving a large class of hard optimization problems.

Item Type:Article
Source:Copyright of this article belongs to Symposium on Genetic Algorithms, (Madison, USA), San Mateo: Morgan Kaufmann.
ID Code:82742
Deposited On:14 Feb 2012 11:25
Last Modified:18 May 2016 23:50

Repository Staff Only: item control page