Giant Trevally Optimizer (GTO): A Novel Metaheuristic Algorithm for Global Optimization and Challenging Engineering Problems
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
Metaheuristic algorithms are becoming powerful methods for solving continuous global optimization and engineering problems due to their flexible implementation on the given problem. Most of these algorithms draw their inspiration from the collective intelligence and hunting behavior of animals in nature. This paper proposes a novel metaheuristic algorithm called the Giant Trevally Optimizer (GTO). In nature, giant trevally feeds on many animals, including fish, cephalopods, and seabirds (sooty terns). In this work, the unique strategies of giant trevally when hunting seabirds are mathematically modeled and are divided into three main steps. In the first step, the foraging movement patterns of giant trevallies are simulated. In the second step, the giant trevallies choose the appropriate area in terms of food where they can hunt for prey. In the last step, the trevally starts to chase the seabird (prey). When the prey is close enough to the trevally, the trevally jumps out of the water and attacks the prey in the air or even snatches the prey from the water surface. The performance of GTO is compared against state-of-the-art metaheuristics for global optimization on a set of forty benchmark functions with different characteristics and five complex engineering problems. The comparative study, scalability analysis, statistical analysis based on the Wilcoxon rank sum test, and the findings suggest that the proposed GTO is an efficient optimizer for global optimization. Note that the MATLAB source codes for GTO will be publicly available after the acceptance of the paper.
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
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569 · cited 2×
“Differential Evolution (DE) [18] is another method inspired by natural evolution.”
MethodA new optimizer using particle swarm theory
Eberhart, R., & Kennedy, J. (2002) · MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science · doi:10.1109/mhs.1995.494215 · Cited by 16,067 · cited 3×
“The most wellknown of these algorithms is Particle Swarm Optimization (PSO) [22].”
BackgroundMethodNo 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 · cited 1×
“The answer to this critical question is the No Free Lunch (NFL) theorem [17].”
BackgroundHolland, J. H. (1992) · Scientific American · doi:10.1038/scientificamerican0792-66 · Cited by 5,764
Bio-inspired computing: Algorithms review, deep analysis, and the scope of applications
Darwish, A. (2018) · Future Computing and Informatics Journal · doi:10.1016/j.fcij.2018.06.001 · Cited by 302 · cited 1×
“Another drawback is that there is no guarantee of finding the global best solution due to its stochastic nature [8].”
Background
Metadata
- Authors
- Sadeeq, H. T., & Abdulazeez, A. M.
- Venue
- IEEE Access
- Published
- 2022
- Volume
- 10
- Pages
- 121615-121640
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W4312850370
- Cited by
- 169
- References
- 5
- FWCI
- 11.55
- Type
- journal article
- Language
- en
- Open access
- gold
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.