Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 297

The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.

Genetic Algorithm Based on Natural Selection Theory for Optimization Problems

Open access
Albadr, Musatafa Abbas, Tiun, Sabrina, Ayob, Masri, AL-Dhief, Fahad · 2020 · Symmetry

Abstract

The metaheuristic genetic algorithm (GA) is based on the natural selection process that falls under the umbrella category of evolutionary algorithms (EA). Genetic algorithms are typically utilized for generating high-quality solutions for search and optimization problems by depending on bio-oriented operators such as selection, crossover, and mutation. However, the GA still suffers from some downsides and needs to be improved so as to attain greater control of exploitation and exploration concerning creating a new population and randomness involvement happening in the population at the solution initialization. Furthermore, the mutation is imposed upon the new chromosomes and hence prevents the achievement of an optimal solution. Therefore, this study presents a new GA that is centered on the natural selection theory and it aims to improve the control of exploitation and exploration. The proposed algorithm is called genetic algorithm based on natural selection theory (GABONST). Two assessments of the GABONST are carried out via (i) application of fifteen renowned benchmark test functions and the comparison of the results with the conventional GA, enhanced ameliorated teaching learning-based optimization (EATLBO), Bat and Bee algorithms. (ii) Apply the GABONST in language identification (LID) through integrating the GABONST with extreme learning machine (ELM) and named (GABONST-ELM). The ELM is considered as one of the most useful learning models for carrying out classifications and regression analysis. The generation of results is carried out grounded upon the LID dataset, which is derived from eight separate languages. The GABONST algorithm has the capability of producing good quality solutions and it also has better control of the exploitation and exploration as compared to the conventional GA, EATLBO, Bat, and Bee algorithms in terms of the statistical assessment. Additionally, the obtained results indicate that (GABONST-ELM)-LID has an effective performance with accuracy reaching up to 99.38%.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.3390/sym12111758

Cites

32 of 32 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 32 references

Research works printed but not linked: 25

  1. Alzaqebah, 2013, An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling, J. Sched., 17, 249, 10.1007/s10951-013-0352-y · doi:10.1007/s10951-013-0352-y
  2. Alzaqebah, 2015, Hybrid bee colony optimization for examination timetabling problems, Comput. Oper. Res., 54, 142, 10.1016/j.cor.2014.09.005 · doi:10.1016/j.cor.2014.09.005
  3. Aziz, 2016, An adaptive guided variable neighborhood search based on honey-bee mating optimization algorithm for the course timetabling problem, Soft Comput., 21, 6755, 10.1007/s00500-016-2225-8 · doi:10.1007/s00500-016-2225-8
  4. Sabar, 2012, A honey-bee mating optimization algorithm for educational timetabling problems, Eur. J. Oper. Res., 216, 533, 10.1016/j.ejor.2011.08.006 · doi:10.1016/j.ejor.2011.08.006
  5. Carvalho, 2016, Combining K-Means and K-Harmonic with Fish School Search Algorithm for data clustering task on graphics processing units, Appl. Soft Comput., 41, 290, 10.1016/j.asoc.2015.12.032 · doi:10.1016/j.asoc.2015.12.032
  6. Yassen, 2015, A Hybrid Meta-Heuristic Algorithm for Vehicle Routing Problem with Time Windows, Int. J. Artif. Intell. Tools, 24, 1550021, 10.1142/S0218213015500219 · doi:10.1142/s0218213015500219
  7. Yassen, 2015, The Effect of Hybridizing Local Search Algorithms with Harmony Search for the Vehicle Routing Problem with Time Windows, J. Theor. Appl. Inf. Technol., 73, 43
  8. Jaddi, 2018, Optimization of neural network using kidney-inspired algorithm with control of filtration rate and chaotic map for real-world rainfall forecasting, Eng. Appl. Artif. Intell., 67, 246, 10.1016/j.engappai.2017.09.012 · doi:10.1016/j.engappai.2017.09.012
  9. Jaddi, 2017, Kidney-inspired algorithm for optimization problems, Commun. Nonlinear Sci. Numer. Simul., 42, 358, 10.1016/j.cnsns.2016.06.006 · doi:10.1016/j.cnsns.2016.06.006
  10. Contreras-Bolton, C., and Parada, V. (2015). Automatic Combination of Operators in a Genetic Algorithm to Solve the Traveling Salesman Problem. PLoS ONE, 10. · doi:10.1371/journal.pone.0137724
  11. Malik, 2019, A Study of Genetic Algorithm and Crossover Techniques, Int. J. Comput. Sci. Mob. Comput., 8, 335
  12. Yu, F., Fu, X., Li, H., and Dong, G. (2016, January 15–17). Improved Roulette Wheel Selection-Based Genetic Algorithm for TSP. Proceedings of the 2016 International Conference on Network and Information Systems for Computers (ICNISC), Wuhan, China. · doi:10.1109/icnisc.2016.041
  13. Zhang, 2019, A hybrid adaptively genetic algorithm for task scheduling problem in the phased array radar, Eur. J. Oper. Res., 272, 868, 10.1016/j.ejor.2018.07.012 · doi:10.1016/j.ejor.2018.07.012
  14. Ahmed, R., Zayed, T., and Nasiri, F. (2020). A Hybrid Genetic Algorithm-Based Fuzzy Markovian Model for the Deterioration Modeling of Healthcare Facilities. Algorithms, 13. · doi:10.3390/a13090210
  15. Kar, S., and Kabir, M.M.J. (2019, January 7–9). Comparative Analysis of Mining Fuzzy Association Rule using Genetic Algorithm. Proceedings of the 2019 International Conference on Electrical, Computer and Communication Engineering (ECCE), Cox’sBazar, Bangladesh. · doi:10.1109/ecace.2019.8679336
  16. Tan, 2017, Multi-attribute intelligent decision-making method based on triangular fuzzy number hesitant intuitionistic fuzzy sets, Syst. Eng. Electron., 39, 829
  17. Li, 2019, Genetic algorithm-based content distribution strategy for F- RAN architectures, ETRI J., 41, 348, 10.4218/etrij.2018-0254 · doi:10.4218/etrij.2018-0254
  18. Serbanescu, 2019, Genetic algorithm/extreme learning machine paradigm for cancer detection, Ann. Univ. Craiova Math. Comput. Sci. Ser., 46, 372
  19. Lipare, A., Edla, D.R., Cheruku, R., and Tripathi, D. (2020). GWO-GA Based Load Balanced and Energy Efficient Clustering Approach for WSN. Smart Trends in Computing and Communications, Springer. · doi:10.1007/978-981-15-0077-0_29
  20. Beg, A.H., and Islam, Z. (2016, January 24–29). Novel crossover and mutation operation in genetic algorithm for clustering. Proceedings of the 2016 IEEE Congress on Evolutionary Computation (CEC), Vancouver, BC, Canada. · doi:10.1109/cec.2016.7744049
  21. Darwin, C., and Wallace, A.R. (1958). Evolution by Natural Selection, Cambridge University Press.
  22. Alexander, V., and Annamalai, P. (2015). An Elitist Genetic Algorithm Based Extreme Learning Machine. Softw. Eng. Intell. Syst., 301–309. · doi:10.1007/978-981-10-0251-9_29
  23. Nayak, 2015, Comparison of modified teaching–learning-based optimization and extreme learning machine for classification of multiple power signal disturbances, Neural Comput. Appl., 27, 2107, 10.1007/s00521-015-2010-0 · doi:10.1007/s00521-015-2010-0
  24. Niu, 2016, A Kind of Parameters Self-adjusting Extreme Learning Machine, Neural Process. Lett., 44, 813, 10.1007/s11063-016-9496-z · doi:10.1007/s11063-016-9496-z
  25. Albadra, 2017, Extreme learning machine: A review, Int. J. Appl. Eng. Res., 12, 4610

Cited by

See all 297

Metadata

Authors
Albadr, M. A., Tiun, S., Ayob, M., & AL-Dhief, F.
Venue
Symmetry
Publisher
MDPI AG
Published
2020-10-23
Volume
12
Issue
11
Pages
1758
ISSN
2073-8994 (ISSN-L)
OpenAlex
W3093873961
Cited by
297
References
32
FWCI
7.58
Type
journal article
Language
en
Open access
gold
Funders
Malaysian government (GUP-2020-063)

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: Genetic Algorithm Based on Natural Selection Theory for Optimization Problems. https://app.cochat.ai/papers/10.3390/sym12111758
The paper
Albadr, M. A., Tiun, S., Ayob, M., & AL-Dhief, F. (2020). Genetic Algorithm Based on Natural Selection Theory for Optimization Problems. Symmetry. https://doi.org/10.3390/sym12111758

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.