2010 Second International Conference on Information Technology and Computer Science 2010
DOI: 10.1109/itcs.2010.39
| View full text |Cite
|
Sign up to set email alerts
|
Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2014
2014
2014
2014

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 12 publications
(2 citation statements)
references
References 5 publications
0
2
0
Order By: Relevance
“…Other hybrid methods have been developed by combining the Particle Swarm paradigm with local search algorithms. It is worth mentioning the Hybrid Simplex Search -Particle Swarm for unconstrained and constrained problems proposed respectively by Fan and Zahara (2007) and Zahara and Hu (2008), and the Complex based PSO for generally constrained problems of Fu and Tong (2010). In the one of Fan and Zahara the Simplex Search of Nelder and Mead (1965) is applied to a subset of the best swarm particles.…”
Section: Hybrid Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Other hybrid methods have been developed by combining the Particle Swarm paradigm with local search algorithms. It is worth mentioning the Hybrid Simplex Search -Particle Swarm for unconstrained and constrained problems proposed respectively by Fan and Zahara (2007) and Zahara and Hu (2008), and the Complex based PSO for generally constrained problems of Fu and Tong (2010). In the one of Fan and Zahara the Simplex Search of Nelder and Mead (1965) is applied to a subset of the best swarm particles.…”
Section: Hybrid Methodsmentioning
confidence: 99%
“…The g-best CPSO version has also been successfully applied to the optimization of discontinuous steam cycle design problems by Martelli (2010), Martelli, Amaldi, et al (2011), Martelli, Nord, andBolland (2012) and Martelli, Kreutz, Gatti, Chiesa, and Consonni (2013). Nevertheless, it has the two following shortcomings: (1) if the function is multimodal or has many steps, it may fail (as already pointed out by Eberhart and Kennedy, 1995) to locate the global optimum, (2) due to the lack of a systematic search strategy, particles inefficiently oscillate around minima, as described in Fan and Zahara (2007) and Fu and Tong (2010).…”
Section: Particle Swarm Optimizermentioning
confidence: 99%