Bio-Inspired Algorithms: 2nd Edition

A special issue of Algorithms (ISSN 1999-4893). This special issue belongs to the section "Evolutionary Algorithms and Machine Learning".

Deadline for manuscript submissions: 30 September 2025 | Viewed by 284

Special Issue Editors


E-Mail Website
Guest Editor
John von Neumann Faculty of Informatics, Óbuda University, H-1034 Budapest, Hungary
Interests: machine learning; neural networks; simulation; GPU programming
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor

Special Issue Information

Dear Colleagues,

In the field of applied informatics, the algorithmic-based procedural approach has distinguised itself with indisputable advantages, but it also has several limitations with respect to hard problems without exact solutions due to incomplete or imperfect information and high computation demands.

It is frequently worth looking towards biology to better understand and model solutions for complex real-world problems. Nature is a great source of inspiration for optimization methods for solving large, indeterministic, inscrutable problems for which information is lacking. Several efficient methods and method groups are based on the process of natural selection, the behavior of living creatures (or groups of living creatures), physical phenomena, or, notably, on the mechanisms of the brain.

For this Special Issue, "Bio-Inspired Algorithms: 2nd Edition", we seek original research papers about novel, bio-inspired methods, analyses of already-existing techniques, or high-level practical applications from the field of computer science or any interdisciplinary field. We welcome manuscripts discussing evolutional (Genetic Algorithms, NSGA, etc.), swarm-intelligence-based (Particle Swarm Optimization, Ant Colony Optimization, the Fireworks Algorithm, etc.), or brain-inspired computing (Neural Networks, Deep Learning, etc.) methods applied in any kind of research project (image processing, natural language processing, general optimization, physical simulations, etc.).

Prof. Dr. Sándor Szénási
Dr. Gábor Kertész
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • design and analysis of bio-inspired methods
  • application of bio-inspired methods
  • limitations of bio-inspired methods
  • ant colony optimization
  • particle swarm optimization
  • firefly algorithm
  • fireworks algorithm
  • bees algorithm
  • evolutionary algorithms
  • neural networks
  • deep learning
  • soft computing methods
  • nature-inspired heuristics

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • Reprint: MDPI Books provides the opportunity to republish successful Special Issues in book format, both online and in print.

Further information on MDPI's Special Issue policies can be found here.

Related Special Issue

Published Papers (1 paper)

Order results
Result details
Select all
Export citation of selected articles as:

Research

15 pages, 356 KiB  
Article
Deep Learning-Based Step Size Determination for Hill Climbing Metaheuristics
by Sándor Szénási, Gábor Légrádi and Gábor Kovács
Algorithms 2025, 18(5), 298; https://doi.org/10.3390/a18050298 - 21 May 2025
Viewed by 132
Abstract
Machine Learning-assisted metaheuristics is a new and promising research topic, combining the advantages of both method families. Metaheuristics are widely used general problem solvers that can be fine-tuned by prior knowledge about the search space; however, this adaptation can be a very time-consuming [...] Read more.
Machine Learning-assisted metaheuristics is a new and promising research topic, combining the advantages of both method families. Metaheuristics are widely used general problem solvers that can be fine-tuned by prior knowledge about the search space; however, this adaptation can be a very time-consuming and complex task. This paper proposes a hybrid variation of the Hill Climbing method using a Machine Learning model to learn this domain-specific knowledge in advance to help determine the optimal step size of each iteration. A Deep Feedforward Neural Network was trained on the steps of thousands of Hill Climbing runs. This model was used in a novel alternating method (using traditional and Machine Learning-based steps) to predict the optimal step size for each iteration. This hybrid algorithm was compared to the already-known variants. The results show that the novel hybrid method is able to find slightly better results than the original Hill Climbing method, requiring significantly fewer fitness calculations. Full article
(This article belongs to the Special Issue Bio-Inspired Algorithms: 2nd Edition)
Show Figures

Figure 1

Back to TopTop