نتایج جستجو برای: genetic convergence
تعداد نتایج: 723447 فیلتر نتایج به سال:
With the development of computer technology and artificial intelligence, the research into examination paper composition receives more and more concern, and the artificial composition of examination paper based on the genetic algorithm gradually demonstrates its superiority. However, due to the complexity of the restraints of paper composition, it has many shortcomings. This paper focuses on th...
A Similarity-based Cellular Selection Mechanisim for Genetic algorithms to Solve Assignment Problems
In this paper, we illustrate a cellular structure mixed with Genetic Algorithms for solving assignment problems which have more than one feasible or optimum solution. Considering similarity among individuals in population, we use two dimensions Cellular Automata in order to place the individuals onto its cells to make the locality and neighborhood on Hamming distance basis. This new structure a...
This paper presents a convergence analysis for the problem of consistent labelling using genetic search. The work builds on a recent empirical study of graph matching where we showed that a Bayesian consistency measure could be e$ciently optimised using a hybrid genetic search procedure which incorporated a hill-climbing step. In the present study we return to the algorithm and provide some the...
This article tries to connect two separate strands of literature concerning genetic algorithms. On the one hand, extensive research took place in mathematics and closely related sciences in order to find out more about the properties of genetic algorithms as stochastic processes. On the other hand, recent economic literature uses genetic algorithms as a metaphor for social learning. This paper ...
Several multi-parent crossover operators had been proposed to increase performance of genetic algorithms. The operators allow several parents to simultaneously take part in creating offspring. The operators need to balance between the two conflicting goals, exploitation and exploration. Strong exploitation allows fast convergence to succeed but can lead to premature convergence while strong exp...
The allocation of design tolerances between the components of a mechanical assembly and manufacturing tolerances can significantly affect the functionality of products and related production costs. This paper introduces Imperialist Competitive Algorithm (ICA) approach to solve the machining tolerance allocation of an overrunning clutch assembly. The objective is to obtain optimum tolerances of...
This paper surveys strategies applied to avoid premature convergence in Genetic Algorithms (GAs). Genetic Algorithm belongs to the set of nature inspired algorithms. The applications of GA cover wide domains such as optimization, pattern recognition, learning, scheduling, economics, bioinformatics, etc. Fitness function is the measure of GA, distributed randomly in the population. Typically, th...
in this paper, following a very recent and new approach, we further generalize recently introduced summability methods, namely, $i$-statistical convergence and $i$-lacunary statistical convergence (which extend the important summability methods, statistical convergence and lacunary statistical convergence using ideals of $mathbb{n}$) and introduce the notions of $i$-statis...
In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید