The DOI matches its Crossref record; 55 of the 55 references it cites were found in a registry or an index.
Group Search Optimizer: An Optimization Algorithm Inspired by Animal Searching Behavior
Abstract
Nature-inspired optimization algorithms, notably evolutionary algorithms (EAs), have been widely used to solve various scientific and engineering problems because of to their simplicity and flexibility. Here we report a novel optimization algorithm, group search optimizer (GSO), which is inspired by animal behavior, especially animal searching behavior. The framework is mainly based on the producer-scrounger model, which assumes that group members search either for “finding” (producer) or for “joining” (scrounger) opportunities. Based on this framework, concepts from animal searching behavior, e.g., animal scanning mechanisms, are employed metaphorically to design optimum searching strategies for solving continuous optimization problems. When tested against benchmark functions, in low and high dimensions, the GSO algorithm has competitive performance to other EAs in terms of accuracy and convergence speed, especially on high-dimensional multimodal problems. The GSO algorithm is also applied to train artificial neural networks. The promising results on three real-world benchmark problems show the applicability of GSO for problem solving.
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
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905
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
Flocks, herds and schools: A distributed behavioral model
Reynolds, C. W. (1987) · Proceedings of the 14th annual conference on Computer graphics and interactive techniques · doi:10.1145/37401.37406 · Cited by 7,714
(2019) · Handbook of Machine Learning · doi:10.1142/9789811205675_0004 · Cited by 6,270
A scaled conjugate gradient algorithm for fast supervised learning
Møller, M. F. (1993) · Neural Networks · doi:10.1016/s0893-6080(05)80056-5 · Cited by 4,052
Evolutionary programming made faster
Yao, X., Liu, Y., & Lin, G. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.771163 · Cited by 3,910
Biomimicry of bacterial foraging for distributed optimization and control
(2002) · IEEE Control Systems · doi:10.1109/mcs.2002.1004010 · Cited by 3,069
Dietterich, T. G. (2000) · Machine Learning · doi:10.1023/a:1007607513941 · Cited by 2,941
Cited by
The Whale Optimization Algorithm
Mirjalili, S., & Lewis, A. (2016) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2016.01.008 · Cited by 14,581
Askarzadeh, A. (2016) · Computers & Structures · doi:10.1016/j.compstruc.2016.03.001 · Cited by 2,216
Dhiman, G., & Kumar, V. (2017) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2017.05.014 · Cited by 1,042
A novel nature-inspired algorithm for optimization: Squirrel search algorithm
Jain, M., Singh, V., & Rani, A. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2018.02.013 · Cited by 961
Nature-Inspired Optimization Algorithms
(2021) · Elsevier eBooks · doi:10.1016/c2019-0-03762-4 · Cited by 755
Braik, M., Hammouri, A., Atwan, J., Al-Betar, M. A., & Awadallah, M. A. (2022) · Knowledge-Based Systems · doi:10.1016/j.knosys.2022.108457 · Cited by 742
Rajwar, K., Deep, K., & Das, S. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-023-10470-y · Cited by 687
Novel meta-heuristic bald eagle search optimisation algorithm
Alsattar, H. A., Zaidan, A. A., & Zaidan, B. B. (2020) · Artificial Intelligence Review · doi:10.1007/s10462-019-09732-5 · Cited by 681
Metaheuristic Algorithms on Feature Selection: A Survey of One Decade of Research (2009-2019)
Agrawal, P., Abutarboush, H. F., Ganesh, T., & Mohamed, A. W. (2021) · IEEE Access · doi:10.1109/access.2021.3056407 · Cited by 613
Tran, D.-D., Vafaeipour, M., El Baghdadi, M., Barrero, R., Van Mierlo, J., & Hegazy, O. (2020) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2019.109596 · Cited by 565
Mohamed, A. W., Hadi, A. A., & Mohamed, A. K. (2020) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-019-01053-x · Cited by 501
Red deer algorithm (RDA): a new nature-inspired meta-heuristic
Fathollahi-Fard, A. M., Hajiaghaei-Keshteli, M., & Tavakkoli-Moghaddam, R. (2020) · Soft Computing · doi:10.1007/s00500-020-04812-z · Cited by 443
A social spider algorithm for global optimization
Yu, J. J. Q., & Li, V. O. K. (2015) · Applied Soft Computing · doi:10.1016/j.asoc.2015.02.014 · Cited by 416
A Brief Review of Nature-Inspired Algorithms for Optimization
Fister, I., Yang, X., Fister, I., Brest, J., & Fister, D. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1307.4186 · Cited by 388
Kaveh, M., & Mesgari, M. S. (2023) · Neural Processing Letters · doi:10.1007/s11063-022-11055-6 · Cited by 292
The Social Engineering Optimizer (SEO)
Fathollahi-Fard, A. M., Hajiaghaei-Keshteli, M., & Tavakkoli-Moghaddam, R. (2018) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2018.04.009 · Cited by 279
Deer Hunting Optimization Algorithm: A New Nature-Inspired Meta-heuristic Paradigm
Brammya, G., Praveena, S., Ninu Preetha, N. S., Ramya, R., Rajakumar, B. R., & Binu, D. (2019) · The Computer Journal · doi:10.1093/comjnl/bxy133 · Cited by 277
Metadata
- Authors
- He, S., Wu, Q. H., & Saunders, J. R.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2009-10
- Volume
- 13
- Issue
- 5
- Pages
- 973-990
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2125281549
- Cited by
- 724
- References
- 55
- FWCI
- 25.30
- Type
- journal article
- Language
- en
- Open access
- closed
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.