2012
DOI: 10.1080/0305215x.2011.598521
|View full text |Cite
|
Sign up to set email alerts
|

Applicability of surrogates to improve efficiency of particle swarm optimization for simulation-based problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0

Year Published

2014
2014
2018
2018

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 40 publications
(14 citation statements)
references
References 25 publications
0
14
0
Order By: Relevance
“…Ratle 2001, Won and Ray 2005, Emmerich, Giannakoglou, and Naujoks 2006and Annicchiarico 2007, and particle swarm optimization algorithms (e.g. Parno, Hemker, and Fowler 2012). Downloaded by [University of Nebraska, Lincoln] at 17:02 29 September 2015…”
Section: Related Workmentioning
confidence: 99%
“…Ratle 2001, Won and Ray 2005, Emmerich, Giannakoglou, and Naujoks 2006and Annicchiarico 2007, and particle swarm optimization algorithms (e.g. Parno, Hemker, and Fowler 2012). Downloaded by [University of Nebraska, Lincoln] at 17:02 29 September 2015…”
Section: Related Workmentioning
confidence: 99%
“…The results of traditional PSO are affected by the particles' initial values, and a local minimum or premature convergence is often obtained [17,32,33]. Thus, using a genetic algorithm, a nonlinear mutation was added after the particle acceleration.…”
Section: Mutation Particle Swarm Optimizationmentioning
confidence: 99%
“…There are many ways the surrogates may be used along with exact function evaluations and Jin (2005 and2011) provides a good survey of different methods. The idea of using surrogates to improve the efficiency of evolutionary methods continues with recent interest in application to particle swarm optimization (e.g., Parno et al 2012;Regis 2014;Sun et al 2015) and evolutionary programming (Regis 2015). Though Jin's paper on surrogate-assisted evolutionary algorithms as well as more recent papers on particle swarm optimization do not specifically mention parallelization, as many have pointed out, the mechanisms behind natureinspired algorithms easily lend themselves to parallelization.…”
Section: Parallel Surrogate-assisted Evolutionary Algorithmsmentioning
confidence: 99%