Parallel and Distributed Processing Symposium, International (2007)
Long Beach, CA, USA
Mar. 26, 2007 to Mar. 30, 2007
Xiaohui Cui , Applied Software Engineering Research, Computational Sciences and Engineering Division, Oak Ridge National Laboratory, Oak Ridge, TN 37831-6085. firstname.lastname@example.org
Thomas E. Potok , Applied Software Engineering Research, Computational Sciences and Engineering Division, Oak Ridge National Laboratory, Oak Ridge, TN 37831-6085. email@example.com
Particle Swarm Optimization (PSO) is a population-based stochastic optimization technique, which can be used to find an optimal, or near optimal, solution to a numerical and qualitative problem. In PSO algorithm, the problem solution emerges from the interactions among many simple individual agents called particles. In the real world, we have to frequently deal with searching and tracking an optimal solution in a dynamical and noisy environment. This demands that the algorithm not only find the optimal solution but also track the trajectory of the non-stationary solution. The traditional PSO algorithm lacks the ability to track the changing optimal solution in a dynamic and noisy environment. In this paper, we present a distributed adaptive PSO (DAPSO) algorithm that can be used to track a non-stationary optimal solution in a dynamically changing and noisy environment.
X. Cui and T. E. Potok, "Distributed Adaptive Particle Swarm Optimizer in Dynamic Environment," 2007 IEEE International Parallel and Distributed Processing Symposium(IPDPS), Rome, 2007, pp. 244.