摘要
To improve the performance of extended particle swarm optimizer, a novel means of stochastic weight deployment is proposed for the iterative equation of velocity updation. In this scheme, one of the weights is specified to a random number within the range of [0, 1] and the other two remain constant configurations. The simulations show that this weight strategy outperforms the previous deterministic approach with respect to success rate and convergence speed. The experiments also reveal that if the weight for global best neighbor is specified to a stochastic number, extended particle swarm optimizer achieves high and robust performance on the given multi-modal function.
To improve the performance of extended particle swarm optimizer, a novel means of stochastic weight deployment is proposed for the iterative equation of velocity updation. In this scheme, one of the weights is specified to a random number within the range of [0, 1] and the other two remain constant configurations. The simulations show that this weight strategy outperforms the previous deterministic approach with respect to success rate and convergence speed. The experiments also reveal that if the weight for global best neighbor is specified to a stochastic number, extended particle swarm optimizer achieves high and robust performance on the given multi-modal function.
基金
the Natural Science Foundation of the Anhui Higher Education Institutions (KJ2008B151)
Key Laboratory of Information Management and Information Economics, Ministry of Education (F0607-36)
