Abstract
This paper introduces a novel variation of binary particle swarm optimization (BPSO) algorithm and a further extension to improve its performance. Firstly, mimicking the behaviors of some creatures group, multiple evolutionary strategies BPSO (MBPSO) is introduced which takes different evolutionary strategies for various particles according to their performances. Then, on the basis of MBPSO, a new strategy is discussed to improve the performance of the MBPSO (M2BPSO) which adopts the concept of the mutation operator aiming to overcome the premature convergence and slow convergent speed during the later stages of the optimization. The proposed two algorithms are tested on seven benchmark functions and their results are compared with those obtained by other methods. Experimental results show that our methods outperform the other algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Kennedy J, Eberhart R C. Particle swarm optimization. In: Proceedings of 1995 IEEE International Conference on Neural Networks, Perth, Australia, 1995. 1942–1948
Kennedy J, Eberhart R C. A discrete binary version of the particle swarm algorithm. In: Proceedings of 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation, Orlando, Florida, USA, 1997
Zhang G P, Yang K, Ding E J. Power allocation scheme for selfish cooperative communications based on game theory and particle swarm optimizer. Sci China Inf Sci, 2010, 53: 1908–1912
Hei Y Q, Li X H, Yi K C, et al. Novel scheduling strategy for downlink multiuser MIMO system: Particle swarm optimization. Sci China Ser F-Inf Sci, 2009, 52: 2279–2289
Pedrasa M A A, Spooner T D, MacGill I F. Scheduling of demand side resources using binary particle swarm optimization. IEEE Trans Power Syst, 2009, 24: 1173–1181
Vetro C, Tegolo D. A binary particle swarm optimization algorithm for a double auction market. artificial markets model methods and applications. Lect Notes Econ Math Syst, 2007, 599: 249–257
Bloomfield M W, Herencia J E, Weaver P M. Analysis and benchmarking of meta-heuristic techniques for lay-up optimization. Comput Struct, 2010, 88: 272–282
Esteban P. Swarm intelligence. Harvard Business Rev, 2001, 79: 152–152
Xie X F, Zhang W J, Yang Z L. Overview of particle swarm optimization. Control Decision, 2003, 18: 129–134
Chen W N, Zhang J, Chung H S H, et al. A novel set-based particle swarm optimization method for discrete optimization problems. IEEE Trans Evol Comput, 2010, 14: 278–300
Zhan Z H, Zhang J, Li Y, et al. Adaptive particle swarm optimization. IEEE Trans Syst Man Cybern B Cybern, 2009, 39: 1362–1381
Lin J T, Chen Y Y. A modified particle swarm optimization for production planning problems in the TFT array process. Expert Syst Appl, 2009, 36: 12264–12271
Garcia-Villoria A, Pastor R. Introducing dynamic diversity into a discrete particle swarm optimization. Comput Operat Res, 2009, 36: 951–966
del Valle Y, Venayagamoorthy G K, Mohagheghi S, et al. Particle swarm optimization: Basic concepts, variants and applications in power systems. IEEE Trans Evol Comput, 2008, 12: 171–195
Li S T, Wu X X, Tan M K. Gene selection using hybrid particle swarm optimization and genetic algorithm. Soft Comput, 2008, 12: 1039–1048
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhao, J., Han, C. & Wei, B. Binary particle swarm optimization with multiple evolutionary strategies. Sci. China Inf. Sci. 55, 2485–2494 (2012). https://doi.org/10.1007/s11432-011-4418-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-011-4418-1