Abstract
Particle Swarm Optimization (PSO) is a metaheuristic that is highly used to solve mono- and multi-objective optimization problems. Two well-differentiated PSO versions have been defined - one that operates in a continuous solution space and one for binary spaces. In this paper, a new version of the Binary PSO algorithm is presented. This version improves its operation by a suitable positioning of the velocity vector. To achieve this, a new modified version of the continuous gBest PSO algorithm is used. The method proposed has been compared with two alternative methods to solve four known test functions. The results obtained have been satisfactory.
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
Kennedy, J., Eberhart, R.: Particle Swarm Optimization. In: IEEE International Conference on Neural Networks, Perth, Australia, vol. IV, pp. 1942–1948. IEEE Service Center, Piscataway (1995)
Hu, X., Shi, Y., Eberhart, R.: Recent Advances in Particle Swarm. In: Congress on Evolutionary Computation, CEC 2004, vol. 1, pp. 90–97 (2004)
Cagnina, L., Esquivel, S., Coello Coello, C.: A bi-population PSO with a shake-mechanism for solving constrained numerical optimization. In: IEEE Congress on Evolutionary Computation, CEC 2007, pp. 670–676 (2007)
Mohais, A., Mendes, R., Ward, C., Postho, C.: Neighborhood Re-Structuring in Particle Swarm Optimization. In: Zhang, S., Jarvis, R.A. (eds.) AI 2005. LNCS (LNAI), vol. 3809, pp. 776–785. Springer, Heidelberg (2005)
Atyabi, A., et al.: Particle Swarm Optimizations: A Critical Review. In: 5th International Conference on Information and Knowledge Technology, Mashad, Iran (2007)
Lanzarini, L., Leza, V., De Giusti, A.: Particle Swarm Optimization with Variable Population Size. In: Rutkowski, L., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2008. LNCS (LNAI), vol. 5097, pp. 438–449. Springer, Heidelberg (2008)
Riget, J., Vesterstrom, J.: A Diversity-Guided Particle Swarm Optimizer – the ARPSO. EVALife Project Group Department of Computer Science (2002)
Clerc, M.: Stagnation Analysis in Particle Swarm Optimisation or What Happens When Nothing Happens.Department of Computer Science; University of Essex. Technical Report CSM-460 (2006)
Peer, E., Van den Bergh, F., Engelbrecht, A.: Using Neighbourhoods with the Guaranteed Convergence PSO. In: Swarm Intelligence Symposium, SIS 2003, pp. 235–242 (2003)
Kennedy, J., Eberhart, R.: A discrete binary version of the particle swarm algorithm. In: Proc. of the World Multiconference on Systemics, Cybernetics and Informatics (WMSCI), pp. 4104–4109 (1997)
Khanesar, M., Teshnehlab, M., Shoorehdeli, M.: A novel Binary Particle Swarm Optimization. In: 18th Mediterranean Conference on Control and Automation, Athens, pp. 1–6 (June 2007)
Shi, Y., Eberhart, R.: Parameter Selection in Particle Swarm Optimization. In: Porto, V.W., Waagen, D. (eds.) EP 1998. LNCS, vol. 1447, pp. 591–600. Springer, Heidelberg (1998) ISBN 3-540-64891-7
Clerc, M., Kennedy, J.: The particle swarm – explosion, stability and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary Computation 6(1), 58–73 (2002)
Van den Bergh, F.: An analysis of particle swarm optimizers. Ph.D. dissertation. Department Computer Science. University Pretoria. South Africa (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lanzarini, L., López, J., Maulini, J.A., De Giusti, A. (2011). A New Binary PSO with Velocity Control. In: Tan, Y., Shi, Y., Chai, Y., Wang, G. (eds) Advances in Swarm Intelligence. ICSI 2011. Lecture Notes in Computer Science, vol 6728. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21515-5_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-21515-5_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21514-8
Online ISBN: 978-3-642-21515-5
eBook Packages: Computer ScienceComputer Science (R0)