Elite opposition-based social spider optimization algorithm for global function optimization
Summary: 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.
- scientific article; zbMATH DE number 6907761
- Enhanced social emotional optimisation algorithm with generalised opposition-based learning
- Diversity-enhanced particle swarm optimization algorithm based on the group behaviour of social spiders
- Adaptive opposition-based learning cuckoo algorithm based on local search enhancement strategy
- Enhancing artificial bee colony algorithm with generalised opposition-based learning
- Enhanced social emotional optimisation algorithm with generalised opposition-based learning
- A novel dynamic generalized opposition-based grey wolf optimization algorithm
- scientific article; zbMATH DE number 6907761 (Why is no real title available?)
- Adaptive multi-swarm backtracking social spider optimization algorithm to solve TSP
- Enhancing sine cosine algorithm based on social learning and elite opposition-based learning
This page was built for publication: Elite opposition-based social spider optimization algorithm for global function optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662596)