2018
DOI: 10.1007/s00521-018-3910-6
|View full text |Cite
|
Sign up to set email alerts
|

Fractional stochastic resonance multi-parameter adaptive optimization algorithm based on genetic algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 31 publications
(13 citation statements)
references
References 15 publications
0
9
0
Order By: Relevance
“…It applies the principles: genetics, mutation, natural selection, and crossover. A set of initial candidates is created, and their corresponding fitness values are calculated [44][45][46]. In GA, many processes are random, like in evolution.…”
Section: Particle Swarm Optimization (Pso) Algorithmmentioning
confidence: 99%
“…It applies the principles: genetics, mutation, natural selection, and crossover. A set of initial candidates is created, and their corresponding fitness values are calculated [44][45][46]. In GA, many processes are random, like in evolution.…”
Section: Particle Swarm Optimization (Pso) Algorithmmentioning
confidence: 99%
“…A crossover operation that exchanges some parts of the two parents to produce a new pair of offspring is conducted to seek promising solutions from the search space [63]. Given a crossover probability ε, if generating a random number R with a standard uniform distribution is less than ε, a locus is chosen between two neighbouring chromosomes, i.e., parents 1 and 2. e chromosomes after this locus are exchanged, thereby forming new offsprings 1 and 2 [64]. e crossover processing can be expressed as follows:…”
Section: Genetic Algorithmmentioning
confidence: 99%
“…e mutation operation ensures the diversity of individuals and prevents solutions from being too similar to avoid obtaining the local optimal solution [65]. Similar to the crossover operation, given a mutation probability ε, if a random number R with a standard uniform distribution is generated and is less than ε, a locus is chosen randomly on the parent, and the value of the locus is reversed, thereby producing a new offspring [64]. e mutation process can be expressed as follows:…”
Section: Genetic Algorithmmentioning
confidence: 99%
“…The genetic algorithm (GA) represents one branch of evolutionary computation that it applies the principles: genetics, mutation, natural selection, and crossover. A set of initial candidates is created, and their corresponding fitness values are calculated [36]- [38]. In GA, many processes are random, like in evolution.…”
Section: B Ga For the Proposed Empimentioning
confidence: 99%