Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Optimization Using Particle Swarms with Near Neighbor Interactions
| |
|
Optimization Using Particle Swarms with Near Neighbor Interactions
Kalyan Veeramachaneni5 , Thanmaya Peram5 , Chilukuri Mohan5 and Lisa Ann Osadciw5 
| (5) |
Department of Electrical Engineering and Computer Science, Syracuse University, Syracuse, NY, 13244-1240 |
Abstract
This paper presents a modification of the particle swarm optimization algorithm (PSO) intended to combat the problem of premature
convergence observed in many applications of PSO. In the new algorithm, each particle is attracted towards the best previous
positions visited by its neighbors, in addition to the other aspects of particle dynamics in PSO. This is accomplished by
using the ratio of the relative fitness and the distance of other particles to determine the direction in which each component
of the particle position needs to be changed. The resulting algorithm, known as Fitness-Distance-Ratio based PSO (FDR-PSO),
is shown to perform significantly better than the original PSO algorithm and several of its variants, on many different benchmark
optimization problems. Avoiding premature convergence allows FDR-PSO to continue search for global optima in difficult multimodal
optimization problems, reaching better solutions than PSO and several of its variants.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|