Name
Abstract | ||
|---|---|---|
Although attractive and repulsive particle swarm optimization ARPSO algorithm keeps the diversity of the swarm adaptively to avoid premature convergence, its search performance is still restricted because of its stochastic search mechanism. In this study, a new hybrid algorithm combining ARPSO with the Quasi-Newton method is proposed to improve the search ability of the swarm. In the proposed algorithm, ARPSO keeps the reasonable search space by controlling the swarm not to lose its diversity, while the Quasi-Newton method is used to perform local search efficiently. The Quasi-Newton method makes the hybrid algorithm converge to optimal solution accurately. The experimental results verify that the proposed hybrid PSO has better convergence performance than some classic PSO algorithms. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-20466-6_48 | ICSI |
Field | DocType | Citations |
Particle swarm optimization,Convergence (routing),Mathematical optimization,Quasi-Newton method,Hybrid algorithm,Swarm behaviour,Premature convergence,Computer science,Multi-swarm optimization,Artificial intelligence,Local search (optimization),Machine learning | Conference | 2 |
PageRank | References | Authors |
0.40 | 1 | 2 |