Journal
APPLIED MATHEMATICS AND COMPUTATION
Volume 229, Issue -, Pages 440-456Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.amc.2013.12.068
Keywords
Particle swarm optimization; Principal component analysis; Line search; Information accumulation; Velocity diversity; Swarm intelligence
Categories
Funding
- National Natural Science Foundation of China [61375066, 61105127, 11171040]
- Chinese Scholarship Council
Ask authors/readers for more resources
Particle swarm optimization (PSO) guides its search direction by a linear learning strategy, in which each particle updates its velocity through a linear combination among its present status, historical best experience and the swarm best experience. The current position of each particle can be seen as a velocity accumulator. Such a storage strategy is easy to achieve, however, it is inefficient when searching in a complex space and has a great restriction on the achieved heuristic information for the promising solutions. Therefore, a new PSO searching mechanism (PCA-PSO) is proposed based on principal component analysis (PCA) and Line Search (IS), in which PCA is mainly used to efficiently mine population information for the promising principal component directions and then LS strategy is utilized on them. PCA-PSO can inherit most of the velocity information of all the particles to guide them to the most promising directions, which have great difference in learning mechanism with usual PSOs. Experimental results and extensive comparisons with hybrid PSOs, pPSA, PCPSO, CLPSO, GL-25, and CoDE show that PCA-PSO consistently and significantly outperforms some PSO variants and is competitive for other state-of-the-art algorithms. (C) 2013 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available