New Search

Export article
Open Access

ABOUT FEATURES OF MUTATION APPLICATION IN A MODIFIED OPERATOR GENETIC ALGORITHM

Leonid Oliinyk, Stanislav Bazhan

Abstract: Genetic algorithm is a method of optimization based on the concepts of natural selection and genetics. Genetic algorithms are used in software development, in artificial intelligence systems, a wide range of optimization problems and in other fields of knowledge.One of the important issues in the theory of genetic algorithms and their modified versions is the search for the best balance between performance and accuracy. The most difficult in this sense are problems where the fitness function in the search field has many local extremes and one global or several global extremes that coincide.The effectiveness of the genetic algorithm depends on various factors, such as the successful creation of the primary population. Also in the theory of genetic algorithms, recombination methods play an important role to obtain a better population of offspring. The aim of this work is to study some types of mutations using a modified genetic algorithm to find the minimum function of one variable.The article presents the results of research and analysis of the impact of some mutation procedures. Namely, the effect of mutation on the speed of achieving the solution of the problem of finding the global extremum of a function of one variable. For which a modified genetic algorithm is used, where the operators of the "generalized crossover" are stochastic matrices
Keywords: Function / optimization / Extremes / genetic algorithm / mutation / operator / Modified Genetic

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

Share this article

Click here to see the statistics on "International Academy Journal Web of Scholar" .
References (1)
    Back to Top Top