Houqe, Tamjid; Chetty, Madhu and Dooley, Laurence S.
|DOI (Digital Object Identifier) Link:||http://dx.doi.org/10.1007/978-3-540-75286-8|
|Google Scholar:||Look up in Google Scholar|
The schemata theorem, on which the working of Genetic Algorithm (GA) is based in its current form, has a fallacious selection procedure and incomplete crossover operation. In this paper, generalization of the schemata theorem has been provided by correcting and removing these limitations. The analysis shows that similarity growth within GA population is inherent due to its stochastic nature. While the stochastic property helps in GA’s convergence. The similarity growth is responsible for stalling and becomes more prevalent for hard optimization problem like protein structure prediction (PSP). While it is very essential that GA should explore the vast and complicated search landscape, in reality, it is often stuck in local minima. This paper shows that, removal of members of population having certain percentage of similarity would keep GA perform better, balancing and maintaining convergence property intact as well as avoids stalling.
|Item Type:||Book Chapter|
|Keywords:||Schemata theorem; twin removal; protein structure prediction; similarity in population; hard optimization problem;|
|Academic Unit/Department:||Mathematics, Computing and Technology > Computing & Communications
Mathematics, Computing and Technology
|Interdisciplinary Research Centre:||Centre for Research in Computing (CRC)|
|Depositing User:||Laurence Dooley|
|Date Deposited:||08 Apr 2008|
|Last Modified:||14 Jan 2016 16:53|
|Share this page:|