Optimization of control parameters for genetic algorithms
IEEE Transactions on Systems, Man and Cybernetics
Evolutionary Algorithms: The Role of Mutation and Recombination
Evolutionary Algorithms: The Role of Mutation and Recombination
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Schemata, Distributions and Graphical Models in Evolutionary Optimization
Journal of Heuristics
Using Genetic Algorithms to Solve NP-Complete Problems
Proceedings of the 3rd International Conference on Genetic Algorithms
An Empirical Study on GAs "Without Parameters"
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Intelligent Mutation Rate Control in Canonical Genetic Algorithms
ISMIS '96 Proceedings of the 9th International Symposium on Foundations of Intelligent Systems
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
The parameter-less genetic algorithm in practice
Information Sciences—Informatics and Computer Science: An International Journal
Adaptive mutation with fitness and allele distribution correlation for genetic algorithms
Proceedings of the 2006 ACM symposium on Applied computing
Costs and Benefits of Tuning Parameters of Evolutionary Algorithms
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Comparing parameter tuning methods for evolutionary algorithms
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
| Hi-index | 0.00 |
Genetic algorithm is one of the well-known population based meta-heuristics. The reasonable performance of the algorithm on a wide variety of problems as well as its simplicity made this algorithm a first choice in lots of cases. However, the algorithm has some weaknesses such as the existence of some parameters that need to be carefully set before the run. The capability of the parameters to change the balance between exploration and exploitation make them crucial. Exploration and exploitation are the bases of every evolutionary algorithm. Conducting a balance between these elements is crucial for the success of any evolutionary algorithm. In this research a GA is proposed on which the crossover and mutation rates are removed. A probability vector holds the probability of the alleles for every locus within the individual. The probability is with regards to the contribution of the allele on either increasing or decreasing the fitness of the chromosome. The probability of an allele will increase if the fitness of the chromosome increases by a change or vise versa. The experiments conducted on a wide range of multi-modal and epistatic problems show good performance of the proposed method in comparison to other algorithms in literature.