ACM Home Page
Please provide us with feedback. Feedback
Allocation of local and global search capabilities of particle in canonical PSO
Full text PdfPdf (321 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 10th annual conference on Genetic and evolutionary computation table of contents
Atlanta, GA, USA
POSTER SESSION: Ant colony optimization, swarm intelligence, and artificial immune systems posters table of contents
Pages 165-166  
Year of Publication: 2008
ISBN:978-1-60558-130-9
Authors
Junqi Zhang  Peking University, Beijing, China
Kun Liu  Peking University, Beijing, China
Ying Tan  Peking University, Beijing, China
Xingui He  Peking University, Beijing, China
Sponsors
ACM: Association for Computing Machinery
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 60,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1389095.1389121
What is a DOI?

ABSTRACT

This paper analyzes theoretically the exact sampling distribution of the particle swarm optimization (PSO) without any assumption imposed by all current analyses. The distribution of particles in the PSO in one-step transition is analyzed in details. Especially, local and global search capabilities of particles in the PSO are defined implicitly, and are allocated adaptively to show how the PSO works by several experiments. In essence, the PSO works by just allocating each particle in the swarm to finish two jobs in probability, locally searching the range around the current best positions and globally searching whole solution space. According to our definitions and analyses, the exact probabilities of the two jobs can be measured by theoretic derivations and experiments whilst how the PSO allocate the particles' search capabilities can be recognized clearly. So we can look into the PSO in depth.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
J. Kennedy and R. Eberhart, Particle Swarm Optimization, Proceedings of the IEEE International Conference on Neural Networks, 1995, pp. 1942--1948.
 
2
R.C.Eberhart and J.Kennedy, A new optimizer using particle swarm theory, Proc. of the 6th Int. Symp. Mcro Machine Human Science, 1995,39--43.
3
4

Collaborative Colleagues:
Junqi Zhang: colleagues
Kun Liu: colleagues
Ying Tan: colleagues
Xingui He: colleagues