Metaheuristics Algorithms and Their Applications

A special issue of Algorithms (ISSN 1999-4893). This special issue belongs to the section "Analysis of Algorithms and Complexity Theory".

Deadline for manuscript submissions: closed (15 April 2023) | Viewed by 5686

Special Issue Editor


E-Mail Website
Guest Editor
Department of Computer Science and Applied Mathematics, Moscow Aviation Institute (National Research University), 111250 Moscow, Russia
Interests: metaheuristic optimization algorithms; optimal control theory

Special Issue Information

Dear Colleagues,

Metaheuristic optimization algorithms, in which heuristics having proven their ability in solving various optimization problems are coordinated by a higher-level algorithm, are widely used in solving engineering, financial, and optimal control problems, as well as those of clustering, classification, and deep machine learning. They are specifically designed to search, generate, or select a heuristic result that can provide a good enough solution to an optimization problem, especially when the information is incomplete or the computing power is limited. Among metaheuristic optimization algorithms, various groups are conventionally distinguished, e.g., evolutionary methods, swarm intelligence methods, algorithms generated by the laws of biology and physics, multistart, multiagent, memetic, human-based, etc.. The classification is conditional, since the same algorithm can belong to several groups at once. Evolutionary methods, in which the search process is associated with the evolution of a solutions set, namely, populations, are widely used. Swarm intelligence algorithms have gained great popularity, in which swarm members (solutions) exchange information during the search process, use information about the absolute leaders and local leaders among neighbors of each solution, and their own best positions. A significant number of studies are related to nature-inspired and bioinspired methods that imitate the characteristic features of the behavior of flocks of various birds, fish, and animals, and groups of insects during foraging, migration, and hunting. A special place is occupied by metaheuristic algorithms based on the laws of physics and biology, as well as taking into account the specifics of human interaction in society.

Metaheuristics algorithms are used for combinatorial optimization, in which an optimal solution is sought over a discrete search space. An example problem is that of the travelling salesman, where the search space of candidate solutions grows faster than exponentially possible as the size of the problem increases, which makes an exhaustive search for the optimal solution infeasible. Metaheuristics are also widely used for job-shop scheduling and job selection problems.

We invite you to submit high-quality papers to this Special Issue on “Metaheuristics Algorithms and Their Applications”, with subjects covering the whole range from theory to applications.

Prof. Dr. Andrei Panteleev
Guest Editor

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

  • metaheuristic algorithms
  • evolutionary algorithms
  • swarm intelligence algorithms
  • nature-inspired optimization
  • bioinspired algorithms
  • physics-based algorithms
  • human-based algorithms
  • memetic algorithms
  • multistart algorithms
  • stochastic search
  • hyperheuristics

Published Papers (3 papers)

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

Research

16 pages, 2958 KiB  
Article
Evolutionary Algorithm with Geometrical Heuristics for Solving the Close Enough Traveling Salesman Problem: Application to the Trajectory Planning of an Unmanned Aerial Vehicle
by Christophe Cariou, Laure Moiroux-Arvis, François Pinet and Jean-Pierre Chanet
Algorithms 2023, 16(1), 44; https://doi.org/10.3390/a16010044 - 9 Jan 2023
Cited by 3 | Viewed by 1577
Abstract
Evolutionary algorithms have been widely studied in the literature to find sub-optimal solutions to complex problems as the Traveling Salesman Problem (TSP). In such a problem, the target positions are usually static and punctually defined. The objective is to minimize a cost function [...] Read more.
Evolutionary algorithms have been widely studied in the literature to find sub-optimal solutions to complex problems as the Traveling Salesman Problem (TSP). In such a problem, the target positions are usually static and punctually defined. The objective is to minimize a cost function as the minimal distance, time or energy. However, in some applications, as the one addressed in this paper—namely the data collection of buried sensor nodes by means of an Unmanned Aerial Vehicle— the targets are areas with varying sizes: they are defined with respect to the radio communication range of each node, ranging from a few meters to several hundred meters according to various parameters (e.g., soil moisture, burial depth, transmit power). The Unmanned Aerial Vehicle has to enter successively in these dynamic areas to collect the data, without the need to pass at the vertical of each node. Some areas can obviously intersect. That leads to solve the Close Enough TSP. To determine a sub-optimal trajectory for the Unmanned Aerial Vehicle, this paper presents an original and efficient strategy based on an evolutionary algorithm completed with geometrical heuristics. The performances of the algorithm are highlighted through scenarios with respectively 15 and 50 target locations. The results are analyzed with respect to the total route length. Finally, conclusions and future research directions are discussed. Full article
(This article belongs to the Special Issue Metaheuristics Algorithms and Their Applications)
Show Figures

Figure 1

23 pages, 15311 KiB  
Article
Design of HIFU Treatment Plans Using Thermodynamic Equilibrium Algorithm
by Salman Lari, Sang Wook Han, Jong Uk Kim and Hyock Ju Kwon
Algorithms 2022, 15(11), 399; https://doi.org/10.3390/a15110399 - 28 Oct 2022
Viewed by 1958
Abstract
High-intensity focused ultrasound (HIFU) is a non-invasive medical procedure, which is mainly used to ablate tumors externally by focusing on them with high-frequency ultrasound. Because a single ablation can process only a small volume of tissue, a succession of ablations is required to [...] Read more.
High-intensity focused ultrasound (HIFU) is a non-invasive medical procedure, which is mainly used to ablate tumors externally by focusing on them with high-frequency ultrasound. Because a single ablation can process only a small volume of tissue, a succession of ablations is required to treat a large volume of cancerous tissue. In order to maximize the therapeutic effect and reduce side effects such as skin burns, careful preoperative treatment planning must be performed to determine the focal location and sonication time for each ablation. This paper proposes a novel optimization algorithm, called the thermodynamic equilibrium algorithm (TEA), inspired by the behavior of thermodynamic systems reaching their equilibrium states. Like other evolutionary algorithms, TEA starts with an initial population. Gas chambers at various thermodynamic states are employed as representatives of the population individuals, and the equilibrium state is regarded as the global minimum. The movement of thermodynamic parameters in the direction of reducing the temperature gradient forms the basis of the proposed evolutionary algorithm. During this movement, the second law of thermodynamics is checked to ensure that entropy will increase in each process. This movement leads to the state where most of the systems are at equilibrium. In this state, the systems are localized at the same position and have the same cost as the global minimum. The TEA was applied to several well-known unconstrained and constrained benchmark cost functions, and the performance was compared with other well-known optimization algorithms. The results showed that the TEA has high potential to handle various types of optimization problems with a good convergence rate and high precision. Finally, the suggested evolutionary approach is applied to HIFU treatment regimens adopting a map of patient-specific material properties and an accurate thermal model. High-quality treatment plans could be created using the suggested method, and the average amount of tissue that is over- or under-treated was less than 0.08 percent. Full article
(This article belongs to the Special Issue Metaheuristics Algorithms and Their Applications)
Show Figures

Figure 1

17 pages, 2075 KiB  
Article
Joints Trajectory Planning of Robot Based on Slime Mould Whale Optimization Algorithm
by Xinning Li, Qin Yang, Hu Wu, Shuai Tan, Qun He, Neng Wang and Xianhai Yang
Algorithms 2022, 15(10), 363; https://doi.org/10.3390/a15100363 - 29 Sep 2022
Cited by 4 | Viewed by 1557
Abstract
The joints running trajectory of a robot directly affects it’s working efficiency, stationarity and working quality. To solve the problems of slow convergence speed and weak global search ability in the current commonly used joint trajectory optimization algorithms, a joint trajectory planning method [...] Read more.
The joints running trajectory of a robot directly affects it’s working efficiency, stationarity and working quality. To solve the problems of slow convergence speed and weak global search ability in the current commonly used joint trajectory optimization algorithms, a joint trajectory planning method based on slime mould whale optimization algorithm (SMWOA) was researched, which could obtain the joint trajectory within a short time and with low energy consumption. On the basis of analyses of the whale optimization algorithm (WOA) and slime mould algorithm (SMA) in detail, the SMWOA was proposed by combining the two methods. By adjusting dynamic parameters and introducing dynamic weights, the proposed SMWOA increased the probability of obtaining the global optimal solution. The optimized results of 15 benchmark functions verified that the optimization accuracy of the SMWOA is clearly better than that of other classical algorithms. An experiment was carried out in which this algorithm was applied to joint trajectory optimization. Taking 6-DOF UR5 manipulator as an example, the results show that the optimized running time of the joints is reduced by 37.674% compared with that before optimization. The efficiency of robot joint motion was improved. This study provides a theoretical basis for the optimization of other engineering fields. Full article
(This article belongs to the Special Issue Metaheuristics Algorithms and Their Applications)
Show Figures

Figure 1

Back to TopTop