The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
A social spider algorithm for global optimization
Open accessAbstract
Graphical abstractDisplay Omitted HighlightsWe propose a new nature-inspired social-spider-based swarm intelligence algorithm.We introduce a new social animal foraging model into meta-heuristic design.We introduce the design of information loss to handle pre-mature convergence.We perform a series of benchmark simulations to demonstrate the performance.We investigate the impact of control parameters on optimization results. The growing complexity of real-world problems has motivated computer scientists to search for efficient problem-solving methods. Metaheuristics based on evolutionary computation and swarm intelligence are outstanding examples of nature-inspired solution techniques. Inspired by the social spiders, we propose a novel social spider algorithm to solve global optimization problems. This algorithm is mainly based on the foraging strategy of social spiders, utilizing the vibrations on the spider web to determine the positions of preys. Different from the previously proposed swarm intelligence algorithms, we introduce a new social animal foraging strategy model to solve optimization problems. In addition, we perform preliminary parameter sensitivity analysis for our proposed algorithm, developing guidelines for choosing the parameter values. The social spider algorithm is evaluated by a series of widely used benchmark functions, and our proposed algorithm has superior performance compared with other state-of-the-art metaheuristics.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
Karaboga, D., & Basturk, B. (2007) · Journal of Global Optimization · doi:10.1007/s10898-007-9149-x · Cited by 7,651
Social Relationships and Health
House, J. S., Landis, K. R., & Umberson, D. (1988) · Science · doi:10.1126/science.3399889 · Cited by 7,073 · cited 1×
“One of the reasons that animals gather and live together is to increase the possibility of successful foraging and reduce the energy cost in this process [8].”
BackgroundDifferential Evolution: A Survey of the State-of-the-Art
Das, S., & Suganthan, P. N. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2059031 · Cited by 5,307
A discrete binary version of the particle swarm algorithm
Kennedy, J., & Eberhart, R. C. (2002) · 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation · doi:10.1109/icsmc.1997.637339 · Cited by 4,767
Nature-Inspired Metaheuristic Algorithms
Yang, X. (2008) · Medical Entomology and Zoology · Cited by 4,556
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
Cited by
A survey on new generation metaheuristic algorithms
Dokeroglu, T., Sevinc, E., Kucukyilmaz, T., & Cosar, A. (2019) · Computers & Industrial Engineering · doi:10.1016/j.cie.2019.106040 · Cited by 923
Metaheuristic research: a comprehensive survey
Hussain, K., Mohd Salleh, M. N., Cheng, S., & Shi, Y. (2019) · Artificial Intelligence Review · doi:10.1007/s10462-017-9605-z · Cited by 864
Hippopotamus optimization algorithm: a novel nature-inspired optimization algorithm
Amiri, M. H., Mehrabi Hashjin, N., Montazeri, M., Mirjalili, S., & Khodadadi, N. (2024) · Scientific Reports · doi:10.1038/s41598-024-54910-3 · Cited by 718
Rajwar, K., Deep, K., & Das, S. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-023-10470-y · Cited by 687
Political Optimizer: A novel socio-inspired meta-heuristic for global optimization
Askari, Q., Younas, I., & Saeed, M. (2020) · Knowledge-Based Systems · doi:10.1016/j.knosys.2020.105709 · Cited by 615
Thirunavukkarasu, M., Sawle, Y., & Lala, H. (2023) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2023.113192 · Cited by 543
Metaheuristic algorithms for PID controller parameters tuning: review, approaches and open problems
Joseph, S. B., Dada, E. G., Abidemi, A., Oyewola, D. O., & Khammas, B. M. (2022) · Heliyon · doi:10.1016/j.heliyon.2022.e09399 · Cited by 458
A comprehensive survey on recent metaheuristics for feature selection
Dokeroglu, T., Deniz, A., & Kiziloz, H. E. (2022) · Neurocomputing · doi:10.1016/j.neucom.2022.04.083 · Cited by 356
Farmland fertility: A new metaheuristic algorithm for solving continuous optimization problems
Shayanfar, H., & Gharehchopogh, F. S. (2018) · Applied Soft Computing · doi:10.1016/j.asoc.2018.07.033 · Cited by 347
A new meta-heuristic optimizer: Pathfinder algorithm
Yapici, H., & Cetinkaya, N. (2019) · Applied Soft Computing · doi:10.1016/j.asoc.2019.03.012 · Cited by 339
A Comprehensive Analysis of Nature-Inspired Meta-Heuristic Techniques for Feature Selection Problem
Sharma, M., & Kaur, P. (2021) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-020-09412-6 · Cited by 303
Volleyball Premier League Algorithm
Moghdani, R., & Salimifard, K. (2018) · Applied Soft Computing · doi:10.1016/j.asoc.2017.11.043 · Cited by 301
A novel hybrid PSO–GWO algorithm for optimization problems
Şenel, F. A., Gökçe, F., Yüksel, A. S., & Yiğit, T. (2019) · Engineering with Computers · doi:10.1007/s00366-018-0668-5 · Cited by 298
Fu, S., Li, K., Huang, H., Ma, C., Fan, Q., & Zhu, Y. (2024) · Artificial Intelligence Review · doi:10.1007/s10462-024-10716-3 · Cited by 287
Zhou, J., Qiu, Y., Armaghani, D. J., Zhang, W., Li, C., Zhu, S., & Tarinejad, R. (2021) · Geoscience Frontiers · doi:10.1016/j.gsf.2020.09.020 · Cited by 277
Metadata
- Authors
- Yu, J. J. Q., & Li, V. O. K.
- Venue
- Applied Soft Computing
- Publisher
- Elsevier BV
- Published
- 2015-05
- Volume
- 30
- Pages
- 614-627
- ISSN
- 1568-4946 (ISSN-L)
- OpenAlex
- W2117034207
- Cited by
- 416
- References
- 44
- FWCI
- 25.96
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.