A Thermodynamical Selection Rule for the Particle Swarm Optimization

The particle swarm optimization, a stochastic, population-based optimization technique, suffers from a phenomenon called premature convergence. That is, the system often loses diversity of the population at an early stage of searching. In this paper, a novel method called the thermodynamical particle swarm optimization (TDPSO)is proposed, which adopts the concepts of the temperature and entropy in the selection rule, getting a hint from the method of simulated annealing to maintain diversity of the population. The performance of this algorithm is compared to the standard PSO algorithm and experiments indicate that it has better performance.

[1]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[2]  Peter J. Angeline,et al.  Evolutionary Optimization Versus Particle Swarm Optimization: Philosophy and Performance Differences , 1998, Evolutionary Programming.

[3]  M. Clerc,et al.  The swarm and the queen: towards a deterministic and adaptive particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[4]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[5]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).