Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-21515-5_14 | ICSI (1) |
Keywords | Field | DocType |
continuous gbest pso algorithm,particle swarm optimization,new modified version,binary pso algorithm,velocity control,well-differentiated pso version,known test function,alternative method,new version,new binary pso,binary space,continuous solution space,swarm intelligence | Particle swarm optimization,Mathematical optimization,Computer science,Swarm intelligence,Velocity vector,Optimization problem,Binary number,Metaheuristic | Conference |
Volume | ISSN | Citations |
6728 | 0302-9743 | 4 |
PageRank | References | Authors |
0.53 | 7 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Laura Lanzarini | 1 | 21 | 8.94 |
| Javier López | 2 | 4 | 0.53 |
| Juan Andrés Maulini | 3 | 4 | 0.53 |
| Armando Giusti | 4 | 71 | 21.17 |