A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf
.
Globally Convergent Particle Swarm Optimization via Branch-and-Bound
2010
Computer and Information Science
Particle swarm optimization (PSO) is a recently developed optimization method that has attracted interest of researchers in various areas. PSO has been shown to be effective in solving a variety of complex optimization problems. With properly chosen parameters, PSO can converge to local optima. However, conventional PSO does not have global convergence. Empirical evidences indicate that the PSO algorithm may fail to reach global optimal solutions for complex problems. We propose to combine the
doi:10.5539/cis.v3n4p60
fatcat:l65zqarn6vhnfdu3fg6gp3qnv4