Elite opposition-based social spider optimization algorithm for global function optimization

25Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.

Abstract

The Social Spider Optimization algorithm (SSO) is a novel metaheuristic optimization algorithm. To enhance the convergence speed and computational accuracy of the algorithm, in this paper, an elite opposition-based Social Spider Optimization algorithm (EOSSO) is proposed; we use an elite opposition-based learning strategy to enhance the convergence speed and computational accuracy of the SSO algorithm. The 23 benchmark functions are tested, and the results show that the proposed elite opposition-based Social Spider Optimization algorithm is able to obtain an accurate solution, and it also has a fast convergence speed and a high degree of stability.

Cite

CITATION STYLE

APA

Zhao, R., Luo, Q., & Zhou, Y. (2017). Elite opposition-based social spider optimization algorithm for global function optimization. Algorithms, 10(1). https://doi.org/10.3390/a10010009

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