Summary
International Symposium on Nonlinear Theory and its Applications
2010
Session Number:B1L-A
Session:
Number:B1L-A1
Canonical Particle Swarm Optimization System
Kenya Jin’no, Takuya Shindo,
pp.193-196
Publication Date:2010/9/5
Online ISSN:2188-5079
DOI:10.34385/proc.44.B1L-A1
PDF download (149.9KB)
Summary:
A particle swarm optimization (PSO) system is one of the powerful systems for solving global optimization problems. The PSO algorithm can search an optimal value of a given evaluation function quickly compared with other proposed meta-heuristics algorithms. The conventional PSO system contains some random factors, therefore, the dynamics of the system can be regarded as stochastic dynamics. In order to analyze the dynamics rigorously, some papers pay attention to deterministic PSO systems which does not contain any stochastic factors. According to these results, the eigenvalues of the system impinge on the dynamics of the particles. Depending on the parameter, the searching ability of the deterministic PSO is decreased. In order to overcome this, we propose a canonical deterministic PSO which can control its eigenvalues easily, and can improve the searching ability. We will confirm relation between the eigenvalues and the searching ability of the optimal value from some numerical experiments.