2016
DOI: 10.1016/j.anucene.2016.04.035
|View full text |Cite
|
Sign up to set email alerts
|

A novel optimization method, Gravitational Search Algorithm (GSA), for PWR core optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 36 publications
(4 citation statements)
references
References 32 publications
0
4
0
Order By: Relevance
“…Figure 5, shows the general process flowchart of the GSA technique and the arrangement of the procedure expressed as the follows, all agents haphazardly introduced. Each agent considered as an applicant arrangement after initialization, Gravitational power, gravitational steady, and resultant powers among specialists are determined, from that point forward, the increasing speeds of particles are characterized [23]. In every cycle and the best solution so far will be updated, then the velocities of all agents will be determined with the position as well finally the process of updating velocities and positions will be stopped by meeting an end criterion [24,25]…”
Section: Psogsa Algorithmmentioning
confidence: 99%
“…Figure 5, shows the general process flowchart of the GSA technique and the arrangement of the procedure expressed as the follows, all agents haphazardly introduced. Each agent considered as an applicant arrangement after initialization, Gravitational power, gravitational steady, and resultant powers among specialists are determined, from that point forward, the increasing speeds of particles are characterized [23]. In every cycle and the best solution so far will be updated, then the velocities of all agents will be determined with the position as well finally the process of updating velocities and positions will be stopped by meeting an end criterion [24,25]…”
Section: Psogsa Algorithmmentioning
confidence: 99%
“…In recent years, some new optimization methods have appeared. On the one hand, new optimization algorithms continue to emerge, including the hybrid algorithm, 16 gravitational search algorithm (GSA), 17 teaching‐learning based optimization algorithm, 18 etc., which own better efficiency and accuracy compared with the previous ones. On the other hand, with the rapid development of computer technology and the successful coupling of various advanced analysis tools, “overall optimization” seems more feasible and reliable.…”
Section: Introductionmentioning
confidence: 99%
“…A closer look does however reveal that this third type of metaheuristic is widely represented as well [35]. Two examples of this type are the Gravitational Search Algorithm [36,37] and the Big Bang-Big Crunch Algorithm [38]. Finally, a rising trend of hybrid metaheuristics, aiming an improved performance by combining components from different metaheuristics, can be observed [39,40].…”
Section: Introductionmentioning
confidence: 99%