Convergence criteria for the particle swarm optimization in a full iterative process - Archive ouverte HAL Access content directly
Conference Papers Year :

Convergence criteria for the particle swarm optimization in a full iterative process

(1) , (2, 3)
1
2
3

Abstract

Although the theoretical aspects of the particle swarm optimization (PSO) seem to be forsaken, the few previous modeling studies -even with some assumptions- enlarged our knowledge of the PSO process. Here, we suggest a new model of PSO where all the N particles of the swarm and their components are considered. The iterative process is formulated by a 3N×3N block triangular matrix and its spectral radius is evaluated and displayed. Besides, the convergence related parametrization criteria are derived. Compared to previous results, a more restrictive acceleration coefficients criterion is found. Simulations are then carried out on CEC 2017 benchmark functions using eight PSO variants and show better results when considering the more restrictive criterion.
Not file

Dates and versions

hal-02274350 , version 1 (29-08-2019)

Identifiers

Cite

Sameh Kessentini, Dominique Barchiesi. Convergence criteria for the particle swarm optimization in a full iterative process. 2017 IEEE Congress on Evolutionary Computation (CEC), Jun 2017, Donostia - San Sebastián, Spain. pp.876-881, ⟨10.1109/CEC.2017.7969401⟩. ⟨hal-02274350⟩
22 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More