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
JADE: Adaptive Differential Evolution With Optional External Archive
Zhang, J., & Sanderson, A. C. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2014613 · Cited by 3,739
Differential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization
Qin, A. K., Huang, V. L., & Suganthan, P. N. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.927706 · Cited by 3,614
Optimization, Learning and Natural Algorithms
Dorigo, M. (1992) · Medical Entomology and Zoology · Cited by 3,307
Biomimicry of bacterial foraging for distributed optimization and control
(2002) · IEEE Control Systems · doi:10.1109/mcs.2002.1004010 · Cited by 3,069
(2005) · Cited by 2,565
Metaheuristics : from desing to implementation
Talbi, E. (2009) · HAL · Cited by 2,494
Adaptive Particle Swarm Optimization
Zhan, Z.-H., Zhang, J., Li, Y., & Chung, H. S.-H. (2009) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2009.2015956 · Cited by 2,075
Foelix, R. F. (1982) · Cited by 1,586
Engineering optimisation by cuckoo search
Yang, X. S., & Deb, S. (2010) · International Journal of Mathematical Modelling and Numerical Optimisation · doi:10.1504/ijmmno.2010.035430 · Cited by 1,583
Ant colony optimization for continuous domains
Socha, K., & Dorigo, M. (2008) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.06.046 · Cited by 1,414
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Price, K. V., Storn, R., & Lampinen, J. (2005) · Cited by 1,406
Differential evolution algorithm with ensemble of parameters and mutation strategies
Mallipeddi, R., Suganthan, P. N., Pan, Q. K., & Tasgetiren, M. F. (2011) · Applied Soft Computing · doi:10.1016/j.asoc.2010.04.024 · Cited by 1,362
Producers and scroungers: A general model and its application to captive flocks of house sparrows
Barnard, C. J., & Sibly, R. M. (1981) · Animal Behaviour · doi:10.1016/s0003-3472(81)80117-0 · Cited by 766
Group Search Optimizer: An Optimization Algorithm Inspired by Animal Searching Behavior
He, S., Wu, Q. H., & Saunders, J. R. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2011992 · Cited by 724
Particle Swarm Optimization With an Aging Leader and Challengers
Chen, W.-N., Zhang, J., Lin, Y., Chen, N., Zhan, Z.-H., Chung, H. S.-H., Li, Y., & Shi, Y.-H. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2011.2173577 · Cited by 635
Chemical-Reaction-Inspired Metaheuristic for Optimization
Lam, A. Y. S., & Li, V. O. K. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2033580 · Cited by 587
Self-citationA swarm optimization algorithm inspired in the behavior of the social-spider
Cuevas, E., Cienfuegos, M., Zaldívar, D., & Pérez-Cisneros, M. (2013) · Expert Systems with Applications · doi:10.1016/j.eswa.2013.05.041 · Cited by 573
Simple Explanation of the No-Free-Lunch Theorem and Its Implications
Ho, Y. C., & Pepyne, D. L. (2002) · Journal of Optimization Theory and Applications · doi:10.1023/a:1021251113462 · Cited by 562
Foraging and Flocking Strategies: Information in an Uncertain Environment
Clark, C. W., & Mangel, M. (1984) · The American Naturalist · doi:10.1086/284228 · Cited by 444
New inspirations in swarm intelligence: a survey
Parpinelli, R. S., & Lopes, H. S. (2011) · International Journal of Bio-Inspired Computation · doi:10.1504/ijbic.2011.038700 · Cited by 402
Akay, B. (2013) · Applied Soft Computing · doi:10.1016/j.asoc.2012.03.072 · Cited by 400
MBO: marriage in honey bees optimization-a Haplometrosis polygynous swarming approach
Abbass, H. A. (2002) · Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546) · doi:10.1109/cec.2001.934391 · Cited by 380
Krishnanand, K. N., & Ghose, D. (2005) · IEEE Swarm Intelligence Symposium · doi:10.1109/sis.2005.1501606 · Cited by 345
Self-Adaptive Multimethod Search for Global Optimization in Real-Parameter Spaces
Vrugt, J. A., Robinson, B. A., & Hyman, J. M. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.924428 · Cited by 334
Akay, B. (2013) · Applied Soft Computing · doi:10.5555/2467341.2467507 · Cited by 319
Artificial Bee Colony (ABC) for multi-objective design optimization of composite structures
Omkar, S. N., Senthilnath, J., Khandelwal, R., Naik, G. N., & Gopalakrishnan, S. (2009) · Applied Soft Computing · doi:10.1016/j.asoc.2009.12.008 · Cited by 296
Global and local real-coded genetic algorithms based on parent-centric crossover operators
García-Martínez, C., Lozano, M., Herrera, F., Molina, D., & Sánchez, A. M. (2008) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.06.043 · Cited by 268
(2005) · Natural Computing Series · doi:10.1007/3-540-31306-0 · Cited by 256
Foraging strategies of spiders
Uetz, G. W. (1992) · Trends in Ecology & Evolution · doi:10.1016/0169-5347(92)90209-t · Cited by 214
Real-Coded Chemical Reaction Optimization
Lam, A. Y. S., Li, V. O. K., & Yu, J. J. Q. (2012) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2011.2161091 · Cited by 175
Self-citationCMA-ES with restarts for solving CEC 2013 benchmark problems
Loshchilov, I. (2013) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2013.6557593 · Cited by 151
Energetic cost of communication
Stoddard, P. K., & Salazar, V. L. (2010) · Journal of Experimental Biology · doi:10.1242/jeb.047910 · Cited by 75
Differential evolution on the CEC-2013 single-objective continuous optimization testbed
Qin, A. K., & Li, X. (2013) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2013.6557689 · Cited by 52
Arbitrary function optimisation with metaheuristics: No free lunch and real-world problems
García‐Martínez, C., Rodríguez, F. J., & Lozano, M. (2012) · Soft Computing · doi:10.1007/s00500-012-0881-x · Cited by 51
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
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.