Abstract
By applying full information and employing the notion of opposition-based learning, a new opposition based learning fully information particle swarm optimiser without velocity is proposed for optimization problems. Different from the standard PSO, particles in swarm only have position without velocity and the personal best position gets updated using opposition-based learning in the algorithm. Besides, all personal best positions are considered to update particle position. The theoretical analysis for the proposed algorithm implies that the particle of the swarm tends to converge to a weighted average of all personal best position. Because of discarding the particle velocity, and using full information and opposition-based learning, the algorithm is the simpler and more effective. The proposed algorithm is applied to some well-known benchmarks. The relative experimental results show that the algorithm achieves better solutions and faster convergence.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of the IEEE Conference on Neural Networks, pp. 1942–1948. IEEE Service Center, Perth (1995)
Tizhoosh, H.R.: Opposition-Based Learning: A New Scheme for Machine Intelligence. In: Int. Conf. on Computational Intelligence for Modelling Control and Automation (CIMCA 2005), Vienna, Austria, vol. I, pp. 695–701 (2005)
Jabeen, H., Jalil, Z., Baig, A.R.: Opposition based initialization in particle swarm optimization O-PSO. In: GECCO Companion, pp. 2047–2052. ACM (2009)
Wang, H., Liu, Y., Li, C., Zeng, S.: Opposition-based Particle Swarm Algorithm with Cauchy Mutation. In: IEEE CEC, pp. 4750–4756 (2007)
Shahzad, F., Baig, A.R., Masood, S., Kamran, M., Naveed, N.: Opposition-Based Particle Swarm Optimization with Velocity Clamping (OVCPSO). Advances in Intelligent and Soft Computing 116, 339–348 (2009)
van den Bergh, F.: An analysis of particle swarm optimizers. PhD thesis, Department of Computer Science, University of Pretoria, South Africa (2002)
van den Bergh, F., Engelbrecht, A.: A study of particle swarm optimization particle trajectories. Information Sciences 176(8), 937–971 (2006)
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)
Trelea, I.C.: The particle swarm optimization algorithm: convergence analysis and parameter selection. Information Processing Letters 85, 317–325 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gao, Y., Peng, L., Li, F., Liu, M., Liu, W. (2013). Opposition-Based Learning Fully Informed Particle Swarm Optimizer without Velocity. In: Tan, Y., Shi, Y., Mo, H. (eds) Advances in Swarm Intelligence. ICSI 2013. Lecture Notes in Computer Science, vol 7928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38703-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-38703-6_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38702-9
Online ISBN: 978-3-642-38703-6
eBook Packages: Computer ScienceComputer Science (R0)