2012
DOI: 10.1155/2012/956498
|View full text |Cite
|
Sign up to set email alerts
|

A Genetic Algorithm with Fuzzy Crossover Operator and Probability

Abstract: The performance of a genetic algorithm is dependent on the genetic operators, in general, and on the type of crossover operator, in particular. The population diversity is usually used as the performance measure for the premature convergence. In this paper, a fuzzy genetic algorithm is proposed for solving binary encoded combinatorial optimization problems. A new crossover operator and probability selection technique is proposed based on the population diversity using a fuzzy logic controller. The measurement … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
15
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 26 publications
(15 citation statements)
references
References 10 publications
0
15
0
Order By: Relevance
“…In single point cross over, two strings in the reproducing pool are selected at random and some portions of the strings are exchanged between the strings. The reproduction operator chooses noble strings and the crossover operator recombines noble strings together to optimistically create an improved sub-string (Varnamkhasti et al 2012; Ozcelik and Erzulumla 2006). The mutation operator varies a string locally to optimistically create a novel string.…”
Section: Methodsmentioning
confidence: 99%
“…In single point cross over, two strings in the reproducing pool are selected at random and some portions of the strings are exchanged between the strings. The reproduction operator chooses noble strings and the crossover operator recombines noble strings together to optimistically create an improved sub-string (Varnamkhasti et al 2012; Ozcelik and Erzulumla 2006). The mutation operator varies a string locally to optimistically create a novel string.…”
Section: Methodsmentioning
confidence: 99%
“…The flow of a commonly genetic algorithm is illustrated in Figure 5. Applying the fuzzy adaptation as we mentioned above the new structure of the genetic algorithm [25,26] is illustrated in Figure 6.…”
Section: Problem Descriptionmentioning
confidence: 99%
“…Poor selection can lead to premature convergence due to reduced diversity in the population over several iterations [18]. While the mutation operator is usually responsible for the maintenance of diversity, an extremely high level of mutation at the beginning can impede convergence on the solution.…”
Section: Adaptable Genetic Algorithmmentioning
confidence: 99%