Opposition-based learning fully informed particle swarm optimizer without velocity

4Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

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. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Gao, Y., Peng, L., Li, F., Liu, M., & Liu, W. (2013). Opposition-based learning fully informed particle swarm optimizer without velocity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7928 LNCS, pp. 79–86). https://doi.org/10.1007/978-3-642-38703-6_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free