scholarly journals Analysis of Selection Methods Used in Genetic Algorithms

2021 ◽  
Vol 4 ◽  
pp. 29-43
Author(s):  
Nataliya Gulayeva ◽  
Artem Ustilov
Keyword(s):  
Growth Rate ◽  
Genetic Algorithms ◽  
Selection Pressure ◽  
Fitness Function ◽  
Selection Method ◽  
Initial Population ◽  
Reproduction Rate ◽  
Selection Methods ◽  
Selection Scheme ◽  
Fitness Value

This paper offers a comprehensive review of selection methods used in the generational genetic algorithms.Firstly, a brief description of the following selection methods is presented: fitness proportionate selection methods including roulette-wheel selection (RWS) and its modifications, stochastic remainder selection with replacement (SRSWR), remainder stochastic independent selection (RSIS), and stochastic universal selection (SUS); ranking selection methods including linear and nonlinear rankings; tournament selection methods including deterministic and stochastic tournaments as well as tournaments with and without replacement; elitist and truncation selection methods; fitness uniform selection scheme (FUSS).Second, basic theoretical statements on selection method properties are given. Particularly, the selection noise, selection pressure, growth rate, reproduction rate, and computational complexity are considered. To illustrate selection method properties, numerous runs of genetic algorithms using the only selection method and no other genetic operator are conducted, and numerical characteristics of analyzed properties are computed. Specifically, to estimate the selection pressure, the takeover time and selection intensity are computed; to estimate the growth rate, the ratio of best individual copies in two consecutive populations is computed; to estimate the selection noise, the algorithm convergence speed is analyzed based on experiments carried out on a specific fitness function assigning the same fitness value to all individuals.Third, the effect of selection methods on the population fitness distribution is investigated. To do this, there are conducted genetic algorithm runs starting with a binomially distributed initial population. It is shown that most selection methods keep the distribution close to the original one providing an increased mean value of the distribution, while others (such as disruptive RWS, exponential ranking, truncation, and FUSS) change the distribution significantly. The obtained results are illustrated with the help of tables and histograms.

A Natural Evolution Based Numerical Optimisation Framework to Develop and Enhance Airfoil-Slat Arrangement

2019 ◽  
Author(s):  
Sushrut Kumar ◽  
Priyam Gupta ◽  
Raj Kumar Singh
Keyword(s):  
Genetic Algorithm ◽  
Fitness Function ◽  
Fuel Efficiency ◽  
Optimal Solution ◽  
Leading Edge ◽  
Initial Population ◽  
Invasive Weed ◽  
Fitness Value ◽  
Leading Edge Slats ◽  
Dynamics Simulations

Abstract Leading Edge Slats are popularly being put into practice due to their capability to provide a significant increase in the lift generated by the wing airfoil and decrease in the stall. Consequently, their optimum design is critical for increased fuel efficiency and minimized environmental impact. This paper attempts to develop and optimize the Leading-Edge Slat geometry and its orientation with respect to airfoil using Genetic Algorithm. The class of Genetic Algorithm implemented was Invasive Weed Optimization as it showed significant potential in converging design to an optimal solution. For the study, Clark Y was taken as test airfoil. Slats being aerodynamic devices require smooth contoured surfaces without any sharp deformities and accordingly Bézier airfoil parameterization method was used. The design process was initiated by producing an initial population of various profiles (chromosomes). These chromosomes are composed of genes which define and control the shape and orientation of the slat. Control points, Airfoil-Slat offset and relative chord angle were taken as genes for the framework and different profiles were acquired by randomly modifying the genes within a decided design space. To compare individual chromosomes and to evaluate their feasibility, the fitness function was determined using Computational Fluid Dynamics simulations conducted on OpenFOAM. The lift force at a constant angle of attack (AOA) was taken as fitness value. It was assigned to each chromosome and the process was then repeated in a loop for different profiles and the fittest wing slat arrangement was obtained which had an increase in CL by 78% and the stall angle improved to 22°. The framework was found capable of optimizing multi-element airfoil arrangements.

scholarly journals Optimasi Pendistribusian Kelas Pada Dosen di STMIK STIKOM Indonesia Menggunakan Algoritma Genetika

2019 ◽  
Vol 2 (1) ◽  
pp. 145-154
Author(s):  
Aniek Suryanti Kusuma ◽  
Komang Sri Aryati
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Genetic Parameters ◽  
Fitness Function ◽  
Genetic Process ◽  
Fitness Value ◽  
Distribution Process ◽  
Class Scheduling ◽  
System Requirements

The stage of class scheduling starts from scheduling courses in classes, then distributing the class to lecturers. The process of distributing classes to lecturers becomes an obstacle for the STMIK STIKOM Indonesia academic body because the academic body must adjust the existing class with the lecturer who is interested in it as well as the lecturer chosen to support a class so that it does not have classes that have a time conflict. One method for solving these problems is by using genetic algorithms that work by generating a number of random solutions and then processing the collection of solutions in a genetic process. There are eight genetic algorithm procedures, which are random chromosome generation procedures, chromosome repair to validate chromosomes from their limits, fitness function to calculate the feasibility of a solution, crossover, mutation, child repair and elitism. The output of this research is in the form of an analysis and determination of the system requirements that must exist. In addition, it produces a trial report on the effect of genetic parameters to determine the effect of changes in the value of genetic parameters on the fitness value and the time used to carry out the distribution process.  

Asymptotic convergence of genetic algorithms

1998 ◽  
Vol 30 (2) ◽  
pp. 521-550 ◽  
Author(s):  
Raphaël Cerf
Keyword(s):  
Genetic Algorithms ◽  
Population Size ◽  
Fitness Function ◽  
Evolutionary Process ◽  
Asymptotic Convergence ◽  
Homogeneous Case ◽  
Selection Scheme ◽  
Convergence Results ◽  
Asymptotic Dynamics ◽  
Simple Selection

We study a markovian evolutionary process which encompasses the classical simple genetic algorithm. This process is obtained by randomly perturbing a very simple selection scheme. Using the Freidlin-Wentzell theory, we carry out a precise study of the asymptotic dynamics of the process as the perturbations disappear. We show how a delicate interaction between the perturbations and the selection pressure may force the convergence toward the global maxima of the fitness function. We put forward the existence of a critical population size, above which this kind of convergence can be achieved. We compute upper bounds of this critical population size for several examples. We derive several conditions to ensure convergence in the homogeneous case and these provide the first mathematically well-founded convergence results for genetic algorithms.

scholarly journals GenHap: A novel computational method based on genetic algorithms for haplotype assembly

2017 ◽  
Author(s):  
Andrea Tangherloni ◽  
Simone Spolaor ◽  
Leonardo Rundo ◽  
Marco S Nobile ◽  
Ivan Merelli ◽  
...  
Keyword(s):  
Genetic Algorithms ◽  
Selection Process ◽  
Fitness Function ◽  
Computational Method ◽  
Nucleotide Polymorphisms ◽  
Optimization Strategy ◽  
Genetic Operators ◽  
Chromosome Conformation ◽  
Haplotype Assembly ◽  
Fitness Value

The process of inferring a full haplotype of a cell is known as haplotyping, which consists in assigning all heterozygous Single Nucleotide Polymorphisms (SNPs) to exactly one of the two chromosomes. In this work, we propose a novel computational method for haplotype assembly based on Genetic Algorithms (GAs), named GenHap. Our approach could efficiently solve large instances of the weighted Minimum Error Correction (wMEC) problem, yielding optimal solutions by means of a global search process. wMEC consists in computing the two haplotypes that partition the sequencing reads into two unambiguous sets with the least number of corrections to the SNP values. Since wMEC was proven to be an NP-hard problem, we tackle this problem exploiting GAs, a population-based optimization strategy that mimics Darwinian processes. In GAs, a population composed of randomly generated individuals undergoes a selection mechanism and is modified by genetic operators. Based on a quality measure (i.e., the fitness value), inspired by Darwin’s “survival of the fittest” laws, each individual is involved in a selection process. Our preliminary experimental results show that GenHap is able to achieve correct solutions in short running times. Moreover, this approach can be used to compute haplotypes in organisms with different ploidity. The proposed evolutionary technique has the advantage that it could be formulated and extended using a multi-objective fitness function taking into account additional insights, such as the methylation patterns of the different chromosomes or the gene proximity in maps achieved through Chromosome Conformation Capture (3C) experiments.

scholarly journals Building a Computer Vocational Guidance System for Graduates of Secondary Educational Institutions Based on a Genetic Algorithm

2020 ◽  
Vol 24 (3) ◽  
pp. 33-43
Author(s):  
A. P. Sergushicheva ◽  
E. N. Davydova
Keyword(s):  
Artificial Intelligence ◽  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Career Guidance ◽  
Optimization Problems ◽  
Fitness Function ◽  
Vocational Guidance ◽  
Guidance System ◽  
Educational Institutions ◽  
Initial Population

The purpose of the article is to present the results of a study on the development of a genetic algorithm to solve the problems of career guidance for graduates of secondary educational institutions and to verify the possibility of its implementation in a computer system. The issue of career guidance for graduates is still relevant, problematic and not fully resolved. According to the authors, the introduction of artificial intelligence technologies in career guidance systems is a promising area that should be paid attention to. Genetic algorithms are widely used to solve search and optimization problems in various subject areas. The authors propose to automate the process of identifying the tendency of secondary school graduates to a particular type of activity by building a vocational guidance system based on a genetic algorithm.Materials and methods. To identify an individual’s predisposition to a specific type of activity, it is necessary to have a list of requirements and contraindications to the profession. Among the ways of describing the norms and requirements for the applicant-specialist are professiograms, lists of necessary competencies and others. To determine the characteristics of the individual that affect the choice of profession, it is possible to use special tests, activating questionnaires, grades in school subjects. The authors carry out the comparison of personality characteristics and requirements through a genetic algorithm. Genetic algorithms belong to the group of evolutionary methods and are based on the evolutionary theory. Among their advantages are conceptual simplicity and wide applicability, resistance to dynamic environmental changes and the ability to self-organize.Results. The genetic algorithm has been developed, in which as a source of information for creating a new population individual certificate evaluations are accepted. Based on these estimates, an initial population of professions is formed. As a result of crossing a pair of individuals from the parent population, a descendant is obtained whose chromosome consists of the genes of both parents. The selection of surviving specimens is based on the percentage of success in the development of each of the professions in the list and the fitness function. The developed algorithm was implemented in a software system. As experiments showed, the genetic algorithm successfully copes with the task of finding the optimal list of professions according to a given criterion.Conclusion. The results of the study show that the use of genetic algorithms provides convenient mechanisms for introducing artificial intelligence methods into the field of career guidance, which improves the quality of recommendations for choosing a profession.

scholarly journals GenHap: A novel computational method based on genetic algorithms for haplotype assembly

2017 ◽  
Author(s):  
Andrea Tangherloni ◽  
Simone Spolaor ◽  
Leonardo Rundo ◽  
Marco S Nobile ◽  
Ivan Merelli ◽  
...  
Keyword(s):  
Genetic Algorithms ◽  
Selection Process ◽  
Fitness Function ◽  
Computational Method ◽  
Nucleotide Polymorphisms ◽  
Optimization Strategy ◽  
Genetic Operators ◽  
Chromosome Conformation ◽  
Haplotype Assembly ◽  
Fitness Value

The process of inferring a full haplotype of a cell is known as haplotyping, which consists in assigning all heterozygous Single Nucleotide Polymorphisms (SNPs) to exactly one of the two chromosomes. In this work, we propose a novel computational method for haplotype assembly based on Genetic Algorithms (GAs), named GenHap. Our approach could efficiently solve large instances of the weighted Minimum Error Correction (wMEC) problem, yielding optimal solutions by means of a global search process. wMEC consists in computing the two haplotypes that partition the sequencing reads into two unambiguous sets with the least number of corrections to the SNP values. Since wMEC was proven to be an NP-hard problem, we tackle this problem exploiting GAs, a population-based optimization strategy that mimics Darwinian processes. In GAs, a population composed of randomly generated individuals undergoes a selection mechanism and is modified by genetic operators. Based on a quality measure (i.e., the fitness value), inspired by Darwin’s “survival of the fittest” laws, each individual is involved in a selection process. Our preliminary experimental results show that GenHap is able to achieve correct solutions in short running times. Moreover, this approach can be used to compute haplotypes in organisms with different ploidity. The proposed evolutionary technique has the advantage that it could be formulated and extended using a multi-objective fitness function taking into account additional insights, such as the methylation patterns of the different chromosomes or the gene proximity in maps achieved through Chromosome Conformation Capture (3C) experiments.

scholarly journals Improving the Performance of Multiobjective Genetic Algorithms: An Elitism-Based Approach

Information ◽  
2020 ◽  
Vol 11 (12) ◽  
pp. 587
Author(s):  
Giorgio Guariso ◽  
Matteo Sangiorgio
Keyword(s):  
Genetic Algorithms ◽  
Fitness Function ◽  
Pareto Frontier ◽  
Optimal Solution ◽  
Variable Number ◽  
Initial Population ◽  
Multiobjective Genetic Algorithms ◽  
Multiobjective Problems ◽  
Rough Approximation ◽  
Successive Generations

Today, many complex multiobjective problems are dealt with using genetic algorithms (GAs). They apply the evolution mechanism of a natural population to a “numerical” population of solutions to optimize a fitness function. GA implementations must find a compromise between the breath of the search (to avoid being trapped into local minima) and its depth (to prevent a rough approximation of the optimal solution). Most algorithms use “elitism”, which allows preserving some of the current best solutions in the successive generations. If the initial population is randomly selected, as in many GA packages, the elite may concentrate in a limited part of the Pareto frontier preventing its complete spanning. A full view of the frontier is possible if one, first, solves the single-objective problems that correspond to the extremes of the Pareto boundary, and then uses such solutions as elite members of the initial population. The paper compares this approach with more conventional initializations by using some classical tests with a variable number of objectives and known analytical solutions. Then we show the results of the proposed algorithm in the optimization of a real-world system, contrasting its performances with those of standard packages.

Asymptotic convergence of genetic algorithms

1998 ◽  
Vol 30 (02) ◽  
pp. 521-550 ◽  
Author(s):  
Raphaël Cerf
Keyword(s):  
Genetic Algorithms ◽  
Population Size ◽  
Fitness Function ◽  
Evolutionary Process ◽  
Asymptotic Convergence ◽  
Homogeneous Case ◽  
Selection Scheme ◽  
Convergence Results ◽  
Asymptotic Dynamics ◽  
Simple Selection

We study a markovian evolutionary process which encompasses the classical simple genetic algorithm. This process is obtained by randomly perturbing a very simple selection scheme. Using the Freidlin-Wentzell theory, we carry out a precise study of the asymptotic dynamics of the process as the perturbations disappear. We show how a delicate interaction between the perturbations and the selection pressure may force the convergence toward the global maxima of the fitness function. We put forward the existence of a critical population size, above which this kind of convergence can be achieved. We compute upper bounds of this critical population size for several examples. We derive several conditions to ensure convergence in the homogeneous case and these provide the first mathematically well-founded convergence results for genetic algorithms.

Enhanced Artificial Intelligent Method for Representing the Photonic Crystal Fiber Profile Index

2018 ◽  
Vol 1 (1) ◽  
pp. 2-19
Author(s):  
Mahmood Sh. Majeed ◽  
Raid W. Daoud
Keyword(s):  
Genetic Algorithms ◽  
Photonic Crystal ◽  
Photonic Crystal Fiber ◽  
New Method ◽  
Proper Solution ◽  
Artificial Intelligent ◽  
Crystal Fiber ◽  
Fitness Value ◽  
First Pass ◽  
Crossover And Mutation

A new method proposed in this paper to compute the fitness in Genetic Algorithms (GAs). In this new method the number of regions, which assigned for the population, divides the time. The fitness computation here differ from the previous methods, by compute it for each portion of the population as first pass, then the second pass begin to compute the fitness for population that lye in the portion which have bigger fitness value. The crossover and mutation and other GAs operator will do its work only for biggest fitness portion of the population. In this method, we can get a suitable and accurate group of proper solution for indexed profile of the photonic crystal fiber (PCF).

The Effectiveness of the Fused Weighted Filter Feature Selection Method to Improve Software Fault Prediction

2016 ◽  
Vol 8 ◽  
pp. 5 ◽  
Author(s):  
Fatemeh Alighardashi ◽  
Mohammad Ali Zare Chahooki
Keyword(s):  
Feature Selection ◽  
Feature Selection Method ◽  
Selection Method ◽  
Machine Learning Algorithms ◽  
Fault Prediction ◽  
Filter Method ◽  
Selection Methods ◽  
Software Projects ◽  
Software Fault Prediction ◽  
Software Fault

Improving the software product quality before releasing by periodic tests is one of the most expensive activities in software projects. Due to limited resources to modules test in software projects, it is important to identify fault-prone modules and use the test sources for fault prediction in these modules. Software fault predictors based on machine learning algorithms, are effective tools for identifying fault-prone modules. Extensive studies are being done in this field to find the connection between features of software modules, and their fault-prone. Some of features in predictive algorithms are ineffective and reduce the accuracy of prediction process. So, feature selection methods to increase performance of prediction models in fault-prone modules are widely used. In this study, we proposed a feature selection method for effective selection of features, by using combination of filter feature selection methods. In the proposed filter method, the combination of several filter feature selection methods presented as fused weighed filter method. Then, the proposed method caused convergence rate of feature selection as well as the accuracy improvement. The obtained results on NASA and PROMISE with ten datasets, indicates the effectiveness of proposed method in improvement of accuracy and convergence of software fault prediction.

Sign in / Sign up

Export Citation Format

Share Document