Metaheuristic Algorithms in Optimal Design of Engineering Problems (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 June 2026 | Viewed by 471

Special Issue Editors


E-Mail Website
Guest Editor
Faculty of Control, Robotics and Electrical Engineering, Poznan University of Technology, 60-965 Poznań, Poland
Interests: heuristic optimization algorithms; constrained optimization; permanent magnet machines; hybrid optimization algorithms
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Department of Electrical/Electronics and Instrumentation Engineering, Institute of Chemical Technology, IndianOil Odisha Campus, Bhubaneswar 751013, Odisha, India
Interests: renewable energy sources; artificial intelligence and optimization algorithms; hydrogen energy-fuel cells
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

Metaheuristic algorithms are a class of optimization algorithms that can solve complex engineering design problems by finding near-optimal solutions efficiently. These algorithms are based on iterative searches of the permissible space, using various heuristics and strategies to explore the design space and refine solutions over time. Metaheuristics are used extensively in many engineering disciplines, including mechanical, civil, electrical, and aerospace engineering, to optimize the performance of systems, components, and processes.

Some of the most popular metaheuristic algorithms used in engineering design include genetic algorithms, particle swarm optimization, simulated annealing, and ant colony optimization. These algorithms can efficiently solve complex optimization problems with many design variables and constraints, allowing engineers to quickly and accurately identify optimal solutions. 

The use of metaheuristic algorithms in engineering design has several advantages, including the ability to handle nonlinear and nonconvex optimization problems, the ability to find near-optimal solutions in a reasonable amount of time, and the ability to handle large-scale optimization problems. However, the effectiveness of these algorithms depends on several factors, such as the quality of the initial design, the choice of optimization algorithm, and the selection of appropriate optimization parameters. 

Overall, metaheuristic algorithms are an important tool for engineers to optimize the design of complex engineering systems and processes. By combining advanced algorithms with domain-specific knowledge and expertise, engineers can design systems that meet performance, cost, and other constraints while achieving optimal outcomes.

Dr. Łukasz Knypiński
Dr. Ramesh Devarapalli
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 250 words) can be sent to the Editorial Office for assessment.

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 1800 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

  • metaheuristic optimization algorithms
  • genetic algorithms
  • particle swarm optimization
  • simulated annealing
  • engineering design

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

36 pages, 2509 KB  
Article
Surrogate-Assisted Slime Mould Algorithm Considering a Dual-Based Merit Criterion for Global Database Management
by Pedro Bento, José Pombo, Hugo Nunes, Maria Calado and Sílvio Mariano
Algorithms 2026, 19(4), 265; https://doi.org/10.3390/a19040265 - 1 Apr 2026
Viewed by 121
Abstract
Metaheuristic algorithms, including evolutionary approaches, are vital for solving non-trivial and non-convex optimization problems. However, real-world engineering often involves high-dimensional, expensive problems that deteriorate performance due to the substantial amount of required fitness evaluations. To address this, a growing trend utilizes evolutionary algorithms [...] Read more.
Metaheuristic algorithms, including evolutionary approaches, are vital for solving non-trivial and non-convex optimization problems. However, real-world engineering often involves high-dimensional, expensive problems that deteriorate performance due to the substantial amount of required fitness evaluations. To address this, a growing trend utilizes evolutionary algorithms assisted by surrogate models, which limit the computational burden by providing alternatives to expensive evaluations. Leveraging the exploration capabilities of the recently developed Slime Mould Algorithm—a metaheuristic with only one tuning parameter that ignores personal best information—this work develops its surrogate-assisted counterpart: the Surrogate-Assisted Slime Mould Algorithm (SASMA). This new approach features an original database management strategy and surrogate building mechanism. To confirm its effectiveness and versatility, SASMA is tested on benchmark mathematical functions for 30 and 100 dimensions, as well as a classical truss design problem, against several surrogate-assisted and metaheuristic algorithms. The proposed SASMA achieved statistically significant improvements in both case studies, outperforming the selected benchmark algorithms on most test functions. Full article
Show Figures

Figure 1

Back to TopTop