A New Optimization Approach Based on Rotational Mutation and Crossover Operator
Evaluating a global optimal point in many global optimization problems in large space is required to more calculations. In this paper, there is presented a new approach for the continuous functions optimization with rotational mutation and crossover operator. This proposed method (RMC) starts from the point which has best fitness value by elitism mechanism and after that rotational mutation and crossover operator are used to reach optimal point. RMC method is implemented by GA (Briefly RMCGA) and is compared with other wellknown algorithms such as: DE, PGA, Grefensstette and Eshelman[15,16] and numerical and simulating results show that RMCGA achieve global optimal point with more decision by smaller generations.
Code (0)
등록된 구현이 없습니다.
Tasks
global-optimizationSimilar Papers 제목 키워드 기반
Novel Methods for Enhancing the Performance of Genetic Algorithms
In this thesis we propose new methods for crossover operator namely: cut on worst gene (COWGC), cut on worst L+R gene (COWLRGC) and Collision Crossovers. And also we propose several types of mutation operator such as: wo…
Generalizing and Unifying Gray-box Combinatorial Optimization Operators
Gray-box optimization leverages the information available about the mathematical structure of an optimization problem to design efficient search operators. Efficient hill climbers and crossover operators have been propos…
Combinatorial OptimizationA multiplicity-preserving crossover operator on graphs. Extended version
Evolutionary algorithms usually explore a search space of solutions by means of crossover and mutation. While a mutation consists of a small, local modification of a solution, crossover mixes the genetic information of t…
Evolutionary AlgorithmsA Survey and Analysis of Evolutionary Operators for Permutations
There are many combinatorial optimization problems whose solutions are best represented by permutations. The classic traveling salesperson seeks an optimal ordering over a set of cities. Scheduling problems often seek op…
Combinatorial OptimizationEvolutionary AlgorithmsSchedulingSurveyAnalysis and Optimization of Probabilities of Beneficial Mutation and Crossover Recombination in a Hamming Space
Inspired by Fisher's geometric approach to study beneficial mutations, we analyse probabilities of beneficial mutation and crossover recombination of strings in a general Hamming space with arbitrary finite alphabet. Mut…