The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
Group teaching optimization algorithm: A novel metaheuristic method for solving global optimization problems
Abstract
Abstract In last 30 years, many metaheuristic algorithms have been developed to solve optimization problems. However, most existing metaheuristic algorithms have extra control parameters except the essential population size and stopping criterion. Considering different characteristics of different optimization problems, how to adjust these extra control parameters is a great challenge for these algorithms in solving different optimization problems. In order to address this challenge, a new metaheuristic algorithm called group teaching optimization algorithm (GTOA) is presented in this paper. The proposed GTOA is inspired by group teaching mechanism. To adapt group teaching to be suitable for using as an optimization technique, without loss of generality, four simple rules are first defined. Then a group teaching model is built under the guide of the four rules, which consists of teacher allocation phase, ability grouping phase, teacher phase and student phase. Note that GTOA needs only the essential population size and stopping criterion without extra control parameters, which has great potential to be used widely. GTOA is first examined over 28 well-known unconstrained benchmark problems and the optimization results are compared with nine state-of-the-art algorithms. Experimental results show the superior performance of the proposed GTOA for these problems in terms of solution quality, convergence speed and stability. Furthermore, GTOA is used to solve four constrained engineering design optimization problems in the real world. Simulation results demonstrate the proposed GTOA can find better solutions with faster speed compared with the reported optimizers.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Mirjalili, S., Mirjalili, S. M., & Lewis, A. (2014) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2013.12.007 · Cited by 19,343
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
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
A modified particle swarm optimizer
Shi, Y., & Eberhart, R. (2002) · 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360) · doi:10.1109/icec.1998.699146 · Cited by 10,229
Cuckoo Search via Lévy flights
Yang, X.-S., & Deb, S. (2009) · 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC) · doi:10.1109/nabic.2009.5393690 · Cited by 6,185
SCA: A Sine Cosine Algorithm for solving optimization problems
Mirjalili, S. (2016) · Knowledge-Based Systems · doi:10.1016/j.knosys.2015.12.022 · Cited by 5,696
Derrac, J., García, S., Molina, D., & Herrera, F. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.02.002 · Cited by 5,512
Rao, R. V., Savsani, V. J., & Vakharia, D. P. (2011) · Computer-Aided Design · doi:10.1016/j.cad.2010.12.015 · Cited by 5,150
Salp Swarm Algorithm: A bio-inspired optimizer for engineering design problems
Mirjalili, S., Gandomi, A. H., Mirjalili, S. Z., Saremi, S., Faris, H., & Mirjalili, S. M. (2017) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2017.07.002 · Cited by 5,082
Cited by
Dwarf Mongoose Optimization Algorithm
Agushaka, J. O., Ezugwu, A. E., & Abualigah, L. (2022) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2022.114570 · Cited by 898
Crayfish optimization algorithm
Jia, H., Rao, H., Wen, C., & Mirjalili, S. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-023-10567-4 · Cited by 644
Golden eagle optimizer: A nature-inspired metaheuristic algorithm
Mohammadi-Balani, A., Dehghan Nayeri, M., Azar, A., & Taghizadeh-Yazdi, M. (2021) · Computers & Industrial Engineering · doi:10.1016/j.cie.2020.107050 · Cited by 480
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
Tuna Swarm Optimization: A Novel Swarm‐Based Metaheuristic Algorithm for Global Optimization
Xie, L., Han, T., Zhou, H., Zhang, Z.-R., Han, B., & Tang, A. (2021) · Computational Intelligence and Neuroscience · doi:10.1155/2021/9210050 · Cited by 379
Metadata
- Authors
- Zhang, Y., & Jin, Z.
- Venue
- Expert Systems with Applications
- Publisher
- Elsevier BV
- Published
- 2020-06
- Volume
- 148
- Pages
- 113246
- ISSN
- 0957-4174 (ISSN-L)
- OpenAlex
- W3003212905
- Cited by
- 262
- References
- 49
- FWCI
- 14.87
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Group teaching optimization algorithm: A novel metaheuristic method for solving global optimization problems. https://app.cochat.ai/papers/10.1016/j.eswa.2020.113246
- The paper
- Zhang, Y., & Jin, Z. (2020). Group teaching optimization algorithm: A novel metaheuristic method for solving global optimization problems. Expert Systems with Applications. https://doi.org/10.1016/j.eswa.2020.113246
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.