Bio-inspired computing: Algorithms review, deep analysis, and the scope of applications
Open accessAbstract
Bio-inspired computing represents the umbrella of different studies of computer science, mathematics, and biology in the last years. Bio-inspired computing optimization algorithms is an emerging approach which is based on the principles and inspiration of the biological evolution of nature to develop new and robust competing techniques. In the last years, the bio-inspired optimization algorithms are recognized in machine learning to address the optimal solutions of complex problems in science and engineering. However, these problems are usually nonlinear and restricted to multiple nonlinear constraints which propose many problems such as time requirements and high dimensionality to find the optimal solution. To tackle the problems of the traditional optimization algorithms, the recent trends tend to apply bio-inspired optimization algorithms which represent a promising approach for solving complex optimization problems. This paper presents state-of-art of nine of recent bio-inspired algorithms, gap analysis, and its applications namely; Genetic Bee Colony (GBC) Algorithm, Fish Swarm Algorithm (FSA), Cat Swarm Optimization (CSO), Whale Optimization Algorithm (WOA), Artificial Algae Algorithm (AAA), Elephant Search Algorithm (ESA), Chicken Swarm Optimization Algorithm (CSOA), Moth flame optimization (MFO), and Grey Wolf Optimization (GWO) algorithm. The previous related works are collected from Scopus databases are presented. Also, we explore some key issues in optimization and some applications for further research. We also analyze in-depth discussions the essence of these algorithms and their connections to self-organization and its applications in different areas of research are presented. As a result, the proposed analysis of these algorithms leads to some key problems that have to be addressed in the future.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
BIAs naturally tend to have higher efficiency than traditional AI methods; the two most widely accepted categories are evolutionary and swarm algorithms.
“These algorithms naturally tend to have a higher efficiency than the traditional AI methods; with the two most widely accepted categories being evolutionary and swarm algorithms [54, 55].”
From Applications and Challenges of Artificial Intelligence in Space Missions (2024) · cites this paper as [55]
In ML, bioinspired optimization algorithms have been found to address the optimal solutions of complex problems in various science and engineering fields.
“In ML, bioinspired optimization algorithms have been found to address the optimal solutions of complex problems in various science and engineering fields [55].”
From Applications and Challenges of Artificial Intelligence in Space Missions (2024) · cites this paper as [55]
Cited by
Sorted by citations
Antonopoulos, I., Robu, V., Couraud, B., Kirli, D., Norbu, S., Kiprakis, A., Flynn, D., Elizondo-Gonzalez, S., & Wattam, S. (2020) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2020.109899 · Cited by 656 · see citing works
Artificial Intelligence Enabled Demand Response: Prospects and Challenges in Smart Grid Environment
Khan, M. A., Saleh, A. M., Waseem, M., & Sajjad, I. A. (2023) · IEEE Access · doi:10.1109/access.2022.3231444 · Cited by 179 · see citing works
Fields, C., & Levin, M. (2022) · Entropy · doi:10.3390/e24060819 · Cited by 121 · see citing works
Applications and Challenges of Artificial Intelligence in Space Missions
Oche, P. A., Ewa, G. A., & Ibekwe, N. (2024) · IEEE Access · doi:10.1109/access.2021.3132500 · Cited by 68 · see citing works
“In ML, bioinspired optimization algorithms have been found to address the optimal solutions of complex problems in various science and engineering fields [55].”
BackgroundMethodInfluential
- Authors
- Darwish, A.
- Affiliations
- Helwan University (EG)
- Corresponding author
- Darwish, Ashraf
- ORCID
- Darwish, Ashraf
- Venue
- Future Computing and Informatics Journal
- Publisher
- Future University in Egypt
- Published
- 2018-12
- Volume
- 3
- Issue
- 2
- Pages
- 231-246
- ISSN
- 2314-7288 (ISSN-L)
- OpenAlex
- W2809430074
- Cited by
- 302
- References
- 0
- Citations by year
- 2026: 13 · 2025: 33 · 2024: 52 · 2023: 50 · 2022: 66 · 2021: 44 · 2020: 34 · 2019: 9 · 2018: 1
- FWCI
- 12.32
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- Locations
- Future Computing and Informatics Journal (publishedVersion, cc-by-nc-nd)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Physical Sciences › Engineering › Biomedical Engineering › Artificial Immune Systems Applications
- Physical Sciences › Engineering › Aerospace Engineering › Antenna Design and Optimization
- Keywords
- bio-inspired optimization algorithms, metaheuristic algorithms, artificial fish swarm algorithm, cat swarm optimization, whale optimization algorithm, artificial algae algorithm, chicken swarm optimization, moth-flame optimization, grey wolf optimizer, self-organization, nonlinear programming, gap analysis
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