Parameter Selection in Particle Swarm Optimization
EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
Particle Swarm Optimization with Variable Population Size
ICAISC '08 Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing
Neighborhood re-structuring in particle swarm optimization
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
The particle swarm - explosion, stability, and convergence in amultidimensional complex space
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
Particle Swarm Optimization (PSO) is a metaheuristic that is highly used to solve mono- and multi-objective optimization problems. Two well-differentiated PSO versions have been defined - one that operates in a continuous solution space and one for binary spaces. In this paper, a new version of the Binary PSO algorithm is presented. This version improves its operation by a suitable positioning of the velocity vector. To achieve this, a new modified version of the continuous gBest PSO algorithm is used. The method proposed has been compared with two alternative methods to solve four known test functions. The results obtained have been satisfactory.