Designing evolutionary algorithms for dynamic optimization problems
Advances in evolutionary computing
Evolutionary Computation in Dynamic and Uncertain Environments (Studies in Computational Intelligence)
Fast Multi-Swarm Optimization for Dynamic Optimization Problems
ICNC '08 Proceedings of the 2008 Fourth International Conference on Natural Computation - Volume 07
The particle swarm - explosion, stability, and convergence in amultidimensional complex space
IEEE Transactions on Evolutionary Computation
Multiswarms, exclusion, and anti-convergence in dynamic environments
IEEE Transactions on Evolutionary Computation
A multiple local search algorithm for continuous dynamic optimization
Journal of Heuristics
Hi-index | 0.00 |
In recent years, particle swarm optimization has emerged as a suitable optimization technique for dynamic environments, mainly its multi-swarm variant. However, in the search for good solutions some particles may produce transitions between non improving ones. Although this fact is usual in stochastic algorithms like PSO, when the problem at hand is dynamic in some sense one can consider that those particles are wasting resources (evaluations, time, etc). To overcome this problem, a novel operator for controlling particle trajectories is introduced into a multi-swarm PSO algorithm. Experimental studies over a benchmark problem shows the benefits of the proposal.