Now showing items 1-6 of 6
Adaptive mutation with fitness and allele distribution correlation for genetic algorithms
(ACM Press, 2006)
In this paper, a new gene based adaptive mutation scheme is proposed for genetic algorithms (GAs), where the information on gene based fitness statistics and on gene based allele distribution statistics are correlated to ...
Experimental study on population-based incremental learning algorithms for dynamic optimization problems
Evolutionary algorithms have been widely used for stationary optimization problems. However, the environments of real world problems are often dynamic. This seriously challenges traditional evolutionary algorithms. In this ...
Associative memory scheme for genetic algorithms in dynamic environments
In recent years dynamic optimization problems have attracted a growing interest from the community of genetic algorithms with several approaches developed to address these problems, of which the memory scheme is a major ...
A memetic algorithm for the university course timetabling problem.
The design of course timetables for academic institutions is a very hectic job due to the exponential number of possible feasible timetables with respect to the problem size. This process involves lots of constraints that ...
Adaptive group mutation for tackling deception in genetic search
In order to study the efficacy of genetic algorithms (GAs), a number of fitness landscapes have been designed and used as test functions. Among these functions a family of deceptive functions have been developed as difficult ...
Primal-dual genetic algorithms for royal road functions
(Elsevier Science Ltd, 2002)
Based on Holland's simple genetic algorithm (SGA) there have been many variations developed. Inspired by the phenomenon of diploid genotype and dominance mechanisms broadly existing in nature, we have proposed a primal-dual ...