Copyright @ Springer-Verlag Berlin Heidelberg 2010.Developing directed mutation methods has been an interesting research topic to improve the performance of genetic algorithms (GAs) for function optimization. This paper introduces a directed mutation (DM) operator for GAs to explore promising areas in the search space. In this DM method, the statistics information regarding the fitness and distribution of individuals over intervals of each dimension is calculated according to the current population and is used to guide the mutation of an individual toward the neighboring interval that has the best statistics result in each dimension. Experiments are carried out to compare the proposed DM technique with an existing directed variation on a se...
In this paper, we propose a selective mutation method for improving the performances of genetic algo...
Abstract The process of mutation has been studied extensively in the field of biology and it has bee...
divCI'sity of lile poplildtioll ill order to;lChiew a good:-.olulion lo an oplimization problem...
Developing directed mutation methods has been an interesting research topic to improve the performan...
Mutation is an important genetic operation that helps to maintain the genetic diversity of the popul...
In a canonical genetic algorithm, the reproduction operators (crossover and mutation) are random in ...
Evolutionary algorithms (EAs) are a class of stochastic search and optimization algorithms that are ...
Evolutionary algorithms (EAs) are a class of stochastic search and optimization algorithms that are ...
The incorporation of contemporary directed mutation techniques into traditional genetic algorithms h...
Genetic algorithms are computer programs that try to mimic the process of natural evolution. These a...
Recent development of large databases, especially those in genetics and proteomics, is pushing the d...
It has long been recognized that mutation is a key ingredient in genetic algorithms (GAs) and the ch...
Copyright @ 2006 ACMIn this paper, a new gene based adaptive mutation scheme is proposed for genetic...
Genetic algorithms (GAs) are dependent on various operators and parameters. The most common evolutio...
The paper discusses the possibility to manage search direction in genetic algorithm crossover and mu...
In this paper, we propose a selective mutation method for improving the performances of genetic algo...
Abstract The process of mutation has been studied extensively in the field of biology and it has bee...
divCI'sity of lile poplildtioll ill order to;lChiew a good:-.olulion lo an oplimization problem...
Developing directed mutation methods has been an interesting research topic to improve the performan...
Mutation is an important genetic operation that helps to maintain the genetic diversity of the popul...
In a canonical genetic algorithm, the reproduction operators (crossover and mutation) are random in ...
Evolutionary algorithms (EAs) are a class of stochastic search and optimization algorithms that are ...
Evolutionary algorithms (EAs) are a class of stochastic search and optimization algorithms that are ...
The incorporation of contemporary directed mutation techniques into traditional genetic algorithms h...
Genetic algorithms are computer programs that try to mimic the process of natural evolution. These a...
Recent development of large databases, especially those in genetics and proteomics, is pushing the d...
It has long been recognized that mutation is a key ingredient in genetic algorithms (GAs) and the ch...
Copyright @ 2006 ACMIn this paper, a new gene based adaptive mutation scheme is proposed for genetic...
Genetic algorithms (GAs) are dependent on various operators and parameters. The most common evolutio...
The paper discusses the possibility to manage search direction in genetic algorithm crossover and mu...
In this paper, we propose a selective mutation method for improving the performances of genetic algo...
Abstract The process of mutation has been studied extensively in the field of biology and it has bee...
divCI'sity of lile poplildtioll ill order to;lChiew a good:-.olulion lo an oplimization problem...