Name
Abstract | ||
|---|---|---|
Particle Swarm Optimization (PSO) algorithm is considered as one of the crowd intelligence optimization algorithms. Dynamic optimization problems in which change(s) may happen over the time are harder to manage than static optimization problems. In this paper an algorithm based on PSO and memory for solving dynamic optimization problems has been proposed. The proposed algorithm uses the memory to store the aging best solutions and uses partitioning for preventing convergence in the population. The proposed approach has been tested on moving peaks benchmark (MPB). The MPB is a suitable problem for simulating dynamic optimization problems. The experimental results on the moving peaks benchmark show that the proposed algorithm is superior to several other well-known and state-of-the-art algorithms in dynamic environments. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-27060-9_21 | ADVANCES IN ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING, MICAI 2015, PT I |
Keywords | Field | DocType |
Swarm intelligence,Dynamic environment,Optimization | Particle swarm optimization,Computer science,Meta-optimization,Swarm intelligence,Algorithm,Multi-swarm optimization,Firefly algorithm,Imperialist competitive algorithm,Optimization problem,Metaheuristic | Conference |
Volume | ISSN | Citations |
9413 | 0302-9743 | 1 |
PageRank | References | Authors |
0.35 | 12 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sadrollah Sadeghi | 1 | 1 | 0.35 |
| Hamid Parvin | 2 | 263 | 41.94 |
| Farhad Rad | 3 | 2 | 3.40 |