Name
Abstract | ||
|---|---|---|
Particle swarm optimization (PSO) is one of the most popular population-based stochastic algorithms for solving complex optimization problems. While PSO is simple and effective, it is originally defined in continuous space. In order to take advantage of PSO to solve combinatorial optimization problems in discrete space, the set-based PSO (S-PSO) framework extends PSO for discrete optimization by redefining the operations in PSO utilizing the set operations. Since its proposal, S-PSO has attracted increasing research attention and has become a promising approach for discrete optimization problems. In this paper, we intend to provide a comprehensive survey on the concepts, development and applications of S-PSO. First, the classification of discrete PSO algorithms is presented. Then the S-PSO framework is given. In particular, we will give an insight into the solution construction strategies, constraint handling strategies, and alternative reinforcement strategies in S-PSO together with its different variants. Furthermore, the extensions and applications of S-PSO are also discussed systemically. Some potential directions for the research of S-PSO are also discussed in this paper. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/s11704-018-7155-4 | Frontiers Comput. Sci. |
Keywords | Field | DocType |
particle swarm optimization,combinatorial optimization,discrete optimization,swarm intelligence,set-based | Particle swarm optimization,Population,Mathematical optimization,Discrete optimization,Computer science,Set operations,Swarm intelligence,Combinatorial optimization,Artificial intelligence,Optimization problem,Machine learning,Discrete space | Journal |
Volume | Issue | ISSN |
12 | 2 | 2095-2228 |
Citations | PageRank | References |
1 | 0.36 | 44 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wei-Neng Chen | 1 | 143 | 13.16 |
| Da-Zhao Tan | 2 | 3 | 0.72 |