Summary

Proceedings of the 2013 International Symposium on Nonlinear Theory and its Applications

2013

Session Number:B1L-B

Session:

Number:205

PSO with a Pseudo Gradient

Takuya Shindo,  Kenya Jin'no,  

pp.205-208

Publication Date:

Online ISSN:2188-5079

DOI:10.15248/proc.2.205

PDF download (508.7KB)

A particle swarm optimization (PSO) is an algorithm that the particle which has the information of its position and velocity searches for the solution in swarm. Especially, based on the numerical simulation results, changing the particle's velocity in the search process influences searching ability of the solution. We pay attention to the velocity of each particle in order to improve the searching ability. Then, particles with good evaluation value are chosen stochastically, and the method to search the best solution by using the position of the particle is proposed.

[1] James Kennedy and Rusell Eberhart, “Particle Swarm Optimization”, in Proc. IEEE Int. Conf. Neural Networks, pp. 1942-1948, 1995.

[2] James Kennedy, “The particle swarm: Social adaptation of knowledge,” in Proc. IEEE Int. Conf. Evolutionary Computation, pp. 303-308, 1997.

[3] Y. Shi and R. Eberhart, “Empirical study of particle swarm optimization,” in Proc. ICEC 1999, pp. 1945-1950, 1999.

[4] M. Clerc and James Kennedy, “The particle swarm - explosion, stability, and convergence in a multidimensional complex space,” IEEE Trans. Evol. Comput., vol. 6, no. 1, pp. 58-73, 2002.

[5] F. van den Bergh and A. P. Engelbrecht, “A cooperative approach to particle swarm optimization,” IEEE Trans. Evol. Comput., vol. 8, no. 3, pp. 225-239, 2004.