Globally Convergent Particle Swarm Optimization via Branch-and-Bound


  •  Zaiyong Tang    
  •  Kallol Bagchi    

Abstract

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 branch-and-bound framework with the particle swarm optimization algorithm. With this integrated approach, convergence to global optimal solutions is theoretically guaranteed. We have developed and implemented the BB-PSO algorithm that combines the efficiency of PSO and effectiveness of the branch-and-bound method. The BB-PSO method was tested with a set of standard benchmark optimization problems. Experimental results confirm that BB-PSO is effective in finding global optimal solutions to problems that may cause difficulties for the PSO algorithm.



This work is licensed under a Creative Commons Attribution 4.0 License.
  • Issn(Print): 1913-8989
  • Issn(Onlne): 1913-8997
  • Started: 2008
  • Frequency: quarterly

Journal Metrics

(The data was calculated based on Google Scholar Citations)

Google-based Impact Factor (2018): 18.20

h-index (January 2018): 23

i10-index (January 2018): 90

h5-index (January 2018): 11

h5-median(January 2018):17

Contact