Combined Algorithm of Particle SwarmOptimization
Narinder SinghDepartment of Mathematics,Punjabi University, PatialaINDIA,( Punjab)-147201Email:email@example.comS.B. SinghDepartment of Mathematics,Punjabi University, Patiala,INDIA,( Punjab)-147201Email:firstname.lastname@example.orgJ.C.BansalABV-Indian Institute of InformationTechnology and Management-Gwalior (M.P), INDIAEmail:email@example.com
A new optimization algorithm isdeveloped in this paper as a CombinedAlgorithm of particle swarm optimization, ispresented, based on a novel philosophy bymodifying the velocity update equation. Thisis done by combined two different PSOalgorithms i.e., Standard Particle SwarmOptimization and Personal Best PositionParticle Swarm Optimization. Itsperformance is compared with the standardPSO (SPSO) by testing it on a set 15 of scalable and 13 non-scalable test problems.Based on the numerical and graphicalanalyses of results it is shown that the CAPSO(Combined Algorithm of Particle SwarmOptimization) outperforms the SPSO(Standard Particle Swarm Optimization), interms of efficiency, reliability, accuracy andstability.
Keywords: Particle Swarm Optimization,CAPSO (Combined Algorithm of Particle Swarm Optimization), global optimization,velocity update equation, Personal Best Position Particle Swarm Optimization.
Standard Particle Swarm Optimization (SPSO):
Particle swarm optimization (PSO) ,  is astochastic, population-based search method,modeled after the behavior of bird flocks. A PSOalgorithm maintains a swarm of individuals(called particles), where each individual (particle)represents a candidate solution. Particles follow avery simple behavior: emulate the success of neighboring particles, and own successesachieved. The position of a particle is thereforeinfluenced by the best particle in a neighborhood,as well as the best solution found by the particle.Particle position
are adjusted using
i i i
x t x t v t
+ = + +
…(1)where the velocity component,
representsthe step size. For the basic PSO.
ij ij j ij ij j j ij
v t v t cr y x c r y x
+ = + − + −
is the inertia weight ,
c and c
arethe acceleration coefficients,
r r U
isthe personal best position of particle
is the neighborhood best position of particle
.The neighborhood best position
, of particle
depends on the neighborhood topology used ,. If a star topology is used, then
refers tothe best position found by the entire swarm. Thatis,
y y t y t y t f y t f f y t i s s
is the swarm size. The resultingalgorithm is referred to as the global best PSO.For the ring topology, the swarm is divided intooverlapping neighborhoods of particles. In thiscase,
is the best position found by theneighborhood of particle
. The resultingalgorithm is referred to as the Local best PSO.The Von Neumann topology definesneighborhoods by organizing particles in a latticestructure. A number of empirical studies haveshown that the Von Neumann topologyoutperforms other neighborhood topologies ,. It is important to note that neighborhoods aredetermined using particle indices, and are not based on any spatial information.A large number of PSO variations have beendeveloped, mainly to improve the accuracy of solutions, diversity, and convergence behavior , . This section reviews those variationsused in this study, from which concepts have been borrowed to develop a new, parameter-freePSO algorithm.
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 8, No. 8, November 2010270http://sites.google.com/site/ijcsis/ISSN 1947-5500