The DOI matches its Crossref record; 260 of the 260 references it cites were found in a registry or an index.
A survey on new generation metaheuristic algorithms
Open accessAbstract
Abstract Metaheuristics are an impressive area of research with extremely important improvements in the solution of intractable optimization problems. Major advances have been made since the first metaheuristic was proposed and numerous new algorithms are still being proposed every day. There is no doubt that the studies in this field will continue to develop in the near future. However, there is an obvious demand to pick out the best performing metaheuristics that are expected to be permanent. In this survey, we distinguish fourteen new and outstanding metaheuristics that have been introduced for the last twenty years (between 2000 and 2020) other than the classical ones such as genetic, particle swarm, and tabu search. The metaheuristics are selected due to their efficient performance, high number of citations, specific evolutionary operators, interesting interaction mechanisms between individuals, parameter tuning/handling concepts, and stagnation prevention methods. After giving absolute foundations of the new generation metaheuristics, recent research trends, hybrid metaheuristics, the lack of theoretical foundations, open problems, advances in parallel metaheuristics and new research opportunities are investigated.
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
1 retracted
Abdel-Basset, M., Manogaran, G., El-Shahat, D., & Mirjalili, S. (2018) · Future Generation Computer Systems · doi:10.1016/j.future.2018.03.020 · Cited by 262
RetractedGenetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
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
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
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
Goldberg, D. E. (1989) · Medical Entomology and Zoology · Cited by 10,109
Karaboga, D., & Basturk, B. (2007) · Journal of Global Optimization · doi:10.1007/s10898-007-9149-x · Cited by 7,651
GSA: A Gravitational Search Algorithm
Rashedi, E., Nezamabadi-pour, H., & Saryazdi, S. (2009) · Information Sciences · doi:10.1016/j.ins.2009.03.004 · Cited by 7,358
Cited by
Abdollahzadeh, B., Gharehchopogh, F. S., & Mirjalili, S. (2021) · Computers & Industrial Engineering · doi:10.1016/j.cie.2021.107408 · Cited by 1,438
Prairie Dog Optimization Algorithm
Ezugwu, A. E., Agushaka, J. O., Abualigah, L., Mirjalili, S., & Gandomi, A. H. (2022) · Neural Computing and Applications · doi:10.1007/s00521-022-07530-9 · Cited by 559
Metaheuristic algorithms for PID controller parameters tuning: review, approaches and open problems
Joseph, S. B., Dada, E. G., Abidemi, A., Oyewola, D. O., & Khammas, B. M. (2022) · Heliyon · doi:10.1016/j.heliyon.2022.e09399 · Cited by 458
Osaba, E., Villar-Rodriguez, E., Del Ser, J., Nebro, A. J., Molina, D., LaTorre, A., Suganthan, P. N., Coello Coello, C. A., & Herrera, F. (2021) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2021.100888 · Cited by 406
Metaheuristics: a comprehensive overview and classification along with bibliometric analysis
Ezugwu, A. E., Shukla, A. K., Nath, R., Akinyelu, A. A., Agushaka, J. O., Chiroma, H., & Muhuri, P. K. (2021) · Artificial Intelligence Review · doi:10.1007/s10462-020-09952-0 · Cited by 305
Metadata
- Authors
- Dokeroglu, T., Sevinc, E., Kucukyilmaz, T., & Cosar, A.
- Venue
- Computers & Industrial Engineering
- Publisher
- Elsevier BV
- Published
- 2019-11
- Volume
- 137
- Pages
- 106040
- ISSN
- 0360-8352 (ISSN-L)
- OpenAlex
- W2972093761
- Cited by
- 923
- References
- 260
- FWCI
- 40.18
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A survey on new generation metaheuristic algorithms. https://app.cochat.ai/papers/10.1016/j.cie.2019.106040
- The paper
- Dokeroglu, T., Sevinc, E., Kucukyilmaz, T., & Cosar, A. (2019). A survey on new generation metaheuristic algorithms. Computers & Industrial Engineering. https://doi.org/10.1016/j.cie.2019.106040
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.