Evaluating the Performance of Adaptive GainingSharing Knowledge Based Algorithm on CEC 2020 Benchmark Problems
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
This paper introduces an enhancement of the recent developed Gaining Sharing Knowledge based algorithm, dubbed as GSK. This algorithm is an excellent example of a contemporary nature-based algorithm which is inspired from the human life behavior of gaining and sharing knowledge to solve the optimization task. GSK algorithm simulates the natural phenomena of human gaining and sharing knowledge using two main phases: junior and senior. A set of initial solutions are generated at the beginning of the search which are consideredjuniors. Later, the individuals are moving to senior stage by interacting with the environment and cooperating with other solutions during the search. The key idea in this work is to extend and improve the original GSK algorithm by proposing adaptive settings to the two important control parameters: knowledge factor and knowledge ratio. These two parameters are responsible to control junior and senior gaining and sharing phases between the solutions during the optimization loop. The algorithm is named AGSK and tested on the recent benchmark suite on bound constrained numerical optimization which consists of different challenging optimization problems with different dimensions. This benchmark is presented in IEEE-CEC2020 competition. When compared with other state-of-the-art algorithms including original GSK, AGSK shows superior performance.
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
Evolutionary algorithms: A critical review and its future prospects
Vikhar, P. A. (2016) · 2016 International Conference on Global Trends in Signal Processing, Information Computing and Communication (ICGTSPICC) · doi:10.1109/icgtspicc.2016.7955308 · Cited by 486 · cited 1×
“In the literature, there are many optimization algorithms to solve this task, among these algorithms we can refer to evolutionary algorithms (EAs) [5].”
Background
Cited by
Fire Hawk Optimizer: a novel metaheuristic algorithm
Azizi, M., Talatahari, S., & Gandomi, A. H. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-022-10173-w · Cited by 391
Metadata
- Authors
- Mohamed, A. W., Hadi, A. A., Mohamed, A. K., & Awad, N. H.
- Venue
- 2020 IEEE Congress on Evolutionary Computation (CEC)
- Publisher
- IEEE
- Published
- 2020-07
- Pages
- 1-8
- OpenAlex
- W3083172984
- Cited by
- 205
- References
- 1
- FWCI
- 9.47
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Evaluating the Performance of Adaptive GainingSharing Knowledge Based Algorithm on CEC 2020 Benchmark Problems. https://app.cochat.ai/papers/10.1109/cec48606.2020.9185901
- The paper
- Mohamed, A. W., Hadi, A. A., Mohamed, A. K., & Awad, N. H. (2020). Evaluating the Performance of Adaptive GainingSharing Knowledge Based Algorithm on CEC 2020 Benchmark Problems. 2020 IEEE Congress on Evolutionary Computation (CEC). https://doi.org/10.1109/cec48606.2020.9185901
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.