1992
DOI: 10.1016/0898-1221(92)90094-x
|View full text |Cite
|
Sign up to set email alerts
|

A modified genetic algorithm for optimal control problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
87
0

Year Published

2004
2004
2023
2023

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 235 publications
(87 citation statements)
references
References 4 publications
0
87
0
Order By: Relevance
“…When F is lower thanF, the higher crossover probability is used to raise the chance of emergence of new and improved individuals. The crossover operation used in the proposed algorithm is arithmetic crossover [35].…”
Section: Crossover Operationmentioning
confidence: 99%
See 1 more Smart Citation
“…When F is lower thanF, the higher crossover probability is used to raise the chance of emergence of new and improved individuals. The crossover operation used in the proposed algorithm is arithmetic crossover [35].…”
Section: Crossover Operationmentioning
confidence: 99%
“…3: Calculate the fitness of each individual in the initial population E 0 according to Equations 27 and 28; 4: for all =1 to L do 5: Select survivor according to the roulette wheel selection rule [34]; 6: end for 7: for all g = 1 to g max do 8: for all =1 to L do 9: Select randomly two individuals and calculate the crossover probability p c according to Equation 29;10: Generate a random floating-point number n random , n random ∈ (0, 1); 11: if n random ≤ p c then 12: Perform arithmetic crossover operation [35]; 13: end if 14: end for 15: for all =1 to L do 16: Calculate the mutation probability p ,m according to Equation 30; 17: Generate a random floating-point number n random , n random ∈ (0, 1); 18: if n random ≤ p l,m then 19: Perform Gaussian mutation operation [36]; 20: end if 21: end for 22: Calculate the fitness of each individual in the new population E g+1 according to Equations 27 and 28; 23: end for 24: Return the minimum CAPEX, A pan and E max B .…”
Section: Algorithm 1 the Capex Minimization Algorithmmentioning
confidence: 99%
“…In the genetic operation, the selection probability determines the probability of individual inheritance to the next generation. The calculation formula proposed by Michalewicz [39] is used here:…”
Section: (2) Initial Populationmentioning
confidence: 99%
“…[27][28][29], ant colony algorithm [30] and simulated annealing algorithm [31][32]. The simulated annealing algorithm is adopted for control force optimization and distribution in this article.…”
Section: Optimization and Distribution Of Tracking Control Forcementioning
confidence: 99%