Analysis and improvement of the binary particle swarm optimization

Sameh Kessentini ()
Additional contact information
Sameh Kessentini: Faculty of sciences of Sfax, University of Sfax

Annals of Operations Research, 2025, vol. 351, issue 1, No 5, 131 pages

Abstract: Abstract Solving binary-real problems with bio-inspired algorithms is an active research matter. However, the efficiency of the employed algorithm varies drastically by tailoring the governing equations or just by adopting “more adequate” parameter setting. Within this framework, we aim to improve the parameter setting of the binary particle swarm optimization (BPSO). We derive a Markov chain model of BPSO. The transition probabilities reveal that the acceleration coefficients control the transition speed between the exploitation and exploration phases. The transition probabilities also depict a poor exploration ratio in high-dimensional search spaces. Increasing the values of the acceleration coefficients may enhance the exploration ratio. Nevertheless, overly high values for these coefficients present some shortcomings. Numerical experiments realized on three different problem sets (e.g. multidimensional knapsack problem) further prove the need to increase the acceleration coefficients as the search space dimension rises. We recommend a set of equations governing the best setting for acceleration coefficients. Finally, a comparison with other BPSO variants reveals the merits of the suggested setting over the conventional ones.

Keywords: Analysis of algorithms; Binary problems; Binary particle swarm optimization; Markov chain model; Parameter setting (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-024-06112-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:351:y:2025:i:1:d:10.1007_s10479-024-06112-3

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-024-06112-3

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().