Advertisement

KNOB Particle Swarm Optimizer

  • Junqi Zhang
  • Kun Liu
  • Ying Tan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6145)

Abstract

It is not trivial to tune the swarm behavior just by parameter setting because of the randomness, complexity and dynamic involved in particle swarm optimizer (PSO). Hundreds of variants in the literature of last decade, brought various mechanism or ideas, sometimes also from outside of the traditional metaheuristics field, to tune the swarm behavior. While, in the same time, additional parameters have to be afforded. This paper proposes a new mechanism, named KNOB, to directly tune the swarm behavior through parameter setting of PSO. KNOB is defined as the first principal component of the statistical probability sequence of exploration and exploitation allocation along the search process. The using of the KNOB to tune PSO by parameter setting is realized through a statistical mapping, between the parameter set and the KNOB, learned by a radial basis function neural network (RBFNN) simulation model. In this way, KNOB provides an easy way to tune PSO directly by its parameter setting. A simple application of KNOB to promote is presented to verify the mechanism of KNOB.

Keywords

Particle Swarm Optimizer Exploitation Exploration search Strategy KNOB 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proc. of the IEEE International Conference on Neural Networks, Perth, Australia, pp. 1942–1948 (1995)Google Scholar
  2. 2.
    Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: Proc. of the 6th Int. Symp. Mcro Machine Human Science, Nagoya, Japan, pp. 39–43 (1995)Google Scholar
  3. 3.
    Clerc, M., Kennedy, J.: The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE Trans. on Evolutionary Computation. 6, 58–73 (2002)CrossRefGoogle Scholar
  4. 4.
    Poli, R., Broomhead, D.: Exact analysis of the sampling distribution for canonical particle swarm optimiser and its convergence during stagnation. In: Proc. of the IEEE International Conference on Genetic And Evolutionary Computation Conference, London, England, pp. 134–141 (2007)Google Scholar
  5. 5.
    Zhang, J., Liu, K., Tan, Y., He, X.G.: Allocation of local and global search capabilities of particle in canonical pso. In: Proc. of Genetic and Evolutionary Computation Conference, pp. 165–166 (2008)Google Scholar
  6. 6.
    Jolliffe, I.T.: Principal component analysis. Springer, Berlin (1986)Google Scholar
  7. 7.
    Bratton, D., Kennedy, J.: Defining a standard for particle swarm optimization. In: Proc. of the IEEE Swarm Intelligence Symposium (SIS), pp. 120–127 (2007)Google Scholar
  8. 8.
    Suganthan, P.N., Hansen, N., Liang, J.J., Deb, K., Chen, Y.P., Auger, A., Tiwari, S.: Problem definitions and evaluation criteria for the cec 2005 special session on real-parameter optimization (2005), http://www.ntu.edu.sg/home/EPNSugan

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Junqi Zhang
    • 1
  • Kun Liu
    • 2
  • Ying Tan
    • 2
  1. 1.Key Laboratory of Embedded System and Service Computing, Ministry of Education, Department of Computer Science and TechnologyTongji UniversityShanghaiChina
  2. 2.Key Laboratory of Machine Perception, Ministry of Education, Department of Machine Intelligence, School of Electronics Engineering and Computer SciencePeking UniversityBeijingChina

Personalised recommendations