Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
2009
DOI: 10.1007/978-3-642-01085-9_5
|View full text |Cite
|
Sign up to set email alerts
|

Particle Swarm Optimization: Performance Tuning and Empirical Analysis

Abstract: Abstract. This chapter presents some of the recent modified variants of Particle Swarm Optimization (PSO). The main focus is on the design and implementation of the modified PSO based on diversity, Mutation, Crossover and efficient Initialization using different distributions and Low-discrepancy sequences. These algorithms are applied to various benchmark problems including unimodal, multimodal, noisy functions and real life applications in engineering fields. The effectiveness of the algorithms is discussed.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
41
0

Year Published

2009
2009
2018
2018

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 53 publications
(41 citation statements)
references
References 28 publications
0
41
0
Order By: Relevance
“…The mean best fitness values (stand for the optimization ability of the algorithm) and standard deviations (stand for the algorithm's stability) are reported in Table 6. The data of five comparing algorithms are from the work of Pant et al (2009). Table 5 shows the common set of all the algorithms in Table 6.…”
Section: Comparison With Five Other Initialization Methodsmentioning
confidence: 99%
“…The mean best fitness values (stand for the optimization ability of the algorithm) and standard deviations (stand for the algorithm's stability) are reported in Table 6. The data of five comparing algorithms are from the work of Pant et al (2009). Table 5 shows the common set of all the algorithms in Table 6.…”
Section: Comparison With Five Other Initialization Methodsmentioning
confidence: 99%
“…One of the drawbacks of most population-based search techniques is that they work on the principle of contracting the search domain toward the global optima (Pant, Thangaraj, & Abraham, 2009). This phenomenon usually leads to the problem of insufficient diversity, in which offspring, outperforming their parents, can no longer be produced after a certain number of evolutionary iterations; thus, all particles stay trapped in a region, which may not even contain local optima.…”
Section: Development Of the Mathematical Optimization Modelmentioning
confidence: 99%
“…rate of change) and the difference between its current position, respectively the best position found by its neighbors, and the best position it has found so far. As the model is iterated, the swarm focuses more and more on an area of the search space containing high-quality solutions [32]. We have to note that PSO is mainly used for continuous optimization while ACO is mainly used for combinatorial optimization.…”
Section: Swarm Intelligencementioning
confidence: 99%