NBPSO (New Binary Particle Swarm Optimization) Algorithm
The code provided here runs NBPSO (New Binary PSO) Algorithm.
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
Particle swarm optimization (PSO) is one of the modern heuristic algorithms that can be applied to continuous and discrete optimization problems.
The original binary PSO (BPSO) has got some disadvantages that make the algorithm not to converge well.
To deal with these disadvantages, a new BPSO (NBPSO) is introduced. The results provided in the fallowing papers show the superiority of the NBPSO.
[1]. M.Rostami Shahrbabak and H.Nezamabadi-pour, " New Approach to Binary PSO Algorithm" 14th Iranian Conference on Electrical Engineering, may 2006.
[2]. H.Nezamabadi-pour, M.Rostami Shahrbabaki and M.Maghfoori Farsangi "Binary Particle Swarm Optimization: Challenges and new
Solutions"The CSI Journal on Computer Science and Engineering Vol. 6, No. 1 (a), 2008.
Cite As
Majid Rostami Shahrbabaki (2026). NBPSO (New Binary Particle Swarm Optimization) Algorithm (https://www.mathworks.com/matlabcentral/fileexchange/32522-nbpso-new-binary-particle-swarm-optimization-algorithm), MATLAB Central File Exchange. Retrieved .
General Information
- Version 1.1.0.0 (6.41 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
