In particle swarm optimization, a set of particles move towards the global optimum point according to their experience and experience of other particles. Parameters such as particle rate, particle best experience, the best experience of all the particles and particle current position are used to determine the next position of each particle. Certain relationships received the input parameters and determined the next position of each particle. In this article, the relationships are accurately assessed and the amount of the effect of input parameters is horizontally set. To set coefficients adaptively, the notion is taken from bee behavior in collecting nectar. This method was implemented on software and examined in the standard search environments. The obtained results indicate the efficiency of this method in increasing the rate of convergence of particles towards the global optimum.
Copyrights © 2016