Abstract.
Binary particle swarm optimization (BinPSO) is introduced as a population-based random search algorithm for discrete binary optimization problems. A number of BinPSO variants have been introduced in the literature and showed performance improvements over the original BinPSO algorithm. However, no detailed performance comparison between these BinPSO variants has been found in the current literature. In this paper, a more thorough performance comparison study on the BinPSO variants in terms of convergence speed, solution quality and performance stability is presented. The BinPSO variants are further compared with a newly adopted cooperative BinPSO variant. The performance evaluation is conducted using De Jong’s test functions, several complex multimodal functions, and a real-world engineering problem, namely optimization of the detection performance of cooperative spectrum sensing in cognitive radio networks. Results show that most of the BinPSO variants exhibit excellent performance on solving De Jong’s test functions while the cooperative BinPSO variant performs better on the complex multimodal problems and the real-world engineering problem. Overall, the cooperative BinPSO variant shows the most promising performance, especially in terms of solution quality and performance stability.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chatterjee, A., Tudu, B., Paul, K.C.: Towards optimized binary pattern generation for grayscale digital halftoning: A binary particle swarm optimization (BPSO) approach. J. Vis. Commun. Image R. 23(8), 1245–1259 (2012)
Chen, E., Li, J., Liu, X.: In search of essential binary discrete particle swarm. Appl. Soft Comput. 11(3), 3260–3269 (2011)
De Jong, K. A.: An analysis of the behaviour of a class of genetic adaptive systems. Unpublished doctoral dissertation, University of Michigan, Ann Arbor, MI, US (1975)
El-Saleh, A.A., Ismail, M., Ali, M.A.M.: Genetic algorithm-assisted soft fusion-based linear cooperative spectrum sensing. IEICE Electron. Express 8(18), 1527–1533 (2011)
Jin, N., Rahmat-Samii, Y.: Advances in particle swarm optimization for antenna designs: real-number, binary, single-objective and multiobjective implementations. IEEE Trans. Antennas Propag. 55(3), 556–567 (2007)
Kameyama, K.: Particle swarm optimization – a survey. IEICE Trans. Inf. & Syst. E92-D(7), 1354–1361 (2009)
Kennedy, J., Eberhart, R.: Swarm Intelligence. Morgan Kaufmann Publisher, San Francisco (2001)
Kennedy, J., Eberhart, R. C.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, Perth, WA (1995)
Kennedy J., Eberhart, R. C.: A discrete binary version of the particle swarm algorithm. In: IEEE International Conference on Systems, Man, and Cybernetics, Orlando, FL (1997)
Kennedy, J., Mendes, R.: Population structure and particle swarm performance. In: Proceedings of the IEEE Congress on Evolutionary Computing, Honolulu, HI, USA (2002)
Khanesar, M.A., Teshnehlab, M., Shoorehdeli, M. A.: A novel binary particle swarm optimization. In: Mediterranean Conference on Control and Automation, Athens, Greece (2007)
Lee, S., Soak, S., Oh, S., Pedrycz, W., Jeon, M.: Modified binary particle swarm optimization. Prog. Natural Sci. 18(9), 1161–1166 (2008)
Messerschmidt, L., Engelbrecht, A.P.: Learning to play games using a PSO-based competitive learning approach. IEEE Trans. Evol. Comput. 8(3), 280–288 (2004)
Pookpunt, S., Ongsakul, W.: Optimal placement of wind turbines within wind farm using binary particle swarm optimization with time-varying acceleration coefficients. Renew. Energ. 55, 266–276 (2013)
Sarath, K.N.V.D., Ravi, V.: Association rule mining using binary particle swarm optimization. Eng. App. Artif. Intel. 26(8), 1832–1840 (2013)
Schutte, J.F., Groenwold, A.A.: Sizing design of truss structures using particle swarms. Struct. Multidisc. Optim. 25(4), 261–269 (2003)
Tasgetiren, M.F., Liang, Y.: A binary particle swarm optimization algorithm for lot sizing problem. J. Econ. Soc. Res. 5(2), 1–20 (2003)
Van den Bergh, F., Engelbrecht, A.P.: Cooperative learning in neural networks using particle swarm optimizers. South African Comput. J. 26, 84–90 (2000)
Van den Bergh, F., Engelbrecht, A.P.: A cooperative approach to particle swarm optimization. IEEE Trans. Evol. Comput. 8(3), 225–239 (2004)
Yuan, X., Nie, H., Su, A., Wang, L., Yuan, Y.: An improved binary particle swarm optimization for unit commitment problem. Expert Syst. Appl. 36(4), 8049–8055 (2009)
Zhao, Z., Xu, S., Zheng, S., Shang, J.: Cognitive radio adaptation using particle swarm optimization. Wirel. Commun. Mob. Comput. 9(7), 875–881 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Lee, Y.L., El-Saleh, A.A., Loo, J., Siyau, M. (2015). Performance Investigation on Binary Particle Swarm Optimization for Global Optimization. In: Demazeau, Y., Decker, K., Bajo Pérez, J., de la Prieta, F. (eds) Advances in Practical Applications of Agents, Multi-Agent Systems, and Sustainability: The PAAMS Collection. PAAMS 2015. Lecture Notes in Computer Science(), vol 9086. Springer, Cham. https://doi.org/10.1007/978-3-319-18944-4_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-18944-4_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18943-7
Online ISBN: 978-3-319-18944-4
eBook Packages: Computer ScienceComputer Science (R0)