Search

Due to their adaptability, Unmanned Aerial Vehicles (UAVs) play an essential role in the Internet of Things (IoT). Using wireless power transfer (WPT) techniques, an UAV can be supplied with energy while in flight, thereby extending the lifetime of this energy-constrained device. This paper investigates the optimization of resource allocation in light of the fact that power transfer and data transmission cannot be performed simultaneously. In this paper, we propose an optimization strategy for the resource allocation of UAVs in sensor communication networks. It is a practical solution to the problem of marine sensor networks that are located far from shore and have limited power. A corresponding system model is summarized based on the scenario and existing theoretical works. The minimum throughput-maximizing object is then formulated as an optimization problem. As swarm intelligence algorithms are utilized effectively in numerous fields, this paper chose to solve the formed optimization problem using the Harris Hawks Optimization and Whale Optimization Algorithms. This paper introduces a method for translating multi-decisions into a row vector in order to adapt swarm intelligence algorithms to the problem, as joint time and energy optimization have two sets of variables. The proposed method performs well in terms of stability and duration. Finally, performance is evaluated through numerical experiments. Simulation results demonstrate that the proposed method performs admirably in the given scenario. [ABSTRACT FROM AUTHOR]

This research introduces innovative approaches to enhance intrusion detection systems (IDSs) by addressing critical challenges in existing methods. Various machine-learning techniques, including nature-inspired metaheuristics, Bayesian algorithms, and swarm intelligence, have been proposed in the past for attribute selection and IDS performance improvement. However, these methods have often fallen short in terms of detection accuracy, detection rate, precision, and F-score. To tackle these issues, the paper presents a novel hybrid feature selection approach combining the Bat metaheuristic algorithm with the Residue Number System (RNS). Initially, the Bat algorithm is utilized to partition training data and eliminate irrelevant attributes. Recognizing the Bat algorithm's slower training and testing times, RNS is incorporated to enhance processing speed. Additionally, principal component analysis (PCA) is employed for feature extraction. In a second phase, RNS is excluded for feature selection, allowing the Bat algorithm to perform this task while PCA handles feature extraction. Subsequently, classification is conducted using naive bayes, and k-Nearest Neighbors. Experimental results demonstrate the remarkable effectiveness of combining RNS with the Bat algorithm, achieving outstanding detection rates, accuracy, and F-scores. Notably, the fusion approach doubles processing speed. The findings are further validated through benchmarking against existing intrusion detection methods, establishing their competitiveness. [ABSTRACT FROM AUTHOR]

The Swarm intelligence algorithm is a very prevalent field in which some scholars have made outstanding achievements. As a representative, Slime mould algorithm (SMA) is widely used because of its superior initial performance. Therefore, this paper focuses on the improvement of the SMA and the mitigation of its stagnation problems. For this aim, the structure of SMA is adjusted to develop the efficiency of the original method. As a stochastic optimizer, SMA mainly stimulates the behavior of slime mold in nature. For the harmony of the exploration and exploitation of SMA, the paper proposed an enhanced algorithm of SMA called ECSMA, in which two mechanisms are embedded into the structure: elite strategy, and chaotic stochastic strategy. The details of the original SMA and the two introduced strategies are given in this paper. Then, the advantages of the improved SMA through mechanism comparison, balance-diversity analysis, and contrasts with other counterparts are validated. The experimental results demonstrate that both mechanisms have a significant enhancing effect on SMA. Also, SMA is applied to four structural design issues of the welded beam design problem, PV design problem, I-beam design problem, and cantilever beam design problem with excellent results. [ABSTRACT FROM AUTHOR]

Aiming at the shortcomings of Chimp optimization algorithm (ChOA), which is easy to fall into local optimal value and imbalance between global exploration ability and local exploitation ability. To improve ChOA from the perspective of multi-strategy mixing, MSChimp was proposed, and the algorithm was applied to global optimization and minimum spanning tree problems. The main research work of this paper is as follows: (1) In the initialization stage of ChOA, an opposition-based learning strategy was introduced to improve the population diversity; Sine Cosine Algorithm (SCA) was introduced in the exploitation process to improve the convergence speed and accuracy of the algorithm in the later stage, so as to balance the exploration and exploitation capabilities of the algorithm. (2) The improved algorithm was compared with different types of meta-heuristic algorithms in 20 benchmark functions and CEC 2019 test sets, and was used to solve the minimum spanning tree. The experimental results show that the improved ChOA has significantly improved the ability to find the optimal value, which verifies the effectiveness and feasibility of MSChimp. Compared with other algorithms, the algorithm proposed in this paper has strong competitiveness. [ABSTRACT FROM AUTHOR]

In existing meta-heuristic algorithms, population initialization forms a huge part towards problem optimization. These calculations can impact variety and combination to locate a productive ideal arrangement. Especially, for perceiving the significance of variety and intermingling, different specialists have attempted to improve the presentation of meta-heuristic algorithms. Particle Swarm Optimization (PSO) algorithm is a populace-based, shrewd stochastic inquiry strategy that is motivated by the inherent honey bee swarm food search mechanism. Population initialization is an indispensable factor in the PSO algorithm. To improve the variety and combination factors, rather than applying the irregular circulation for the introduction of the populace, semi-arbitrary successions are more helpful. This examination presents a thorough overview of the different PSO initialization approaches which are dependent on semi-arbitrary successions systems. In this precise review, the best in class in the populace instatement is uncovered. The procedures are classified by utilizing a theoretical model that parts the cycle of populace introduction into two phases: that is, right now expressly or certainly utilized for reinstatement in every single present approach. The deliberate investigation unveils the potential examination zones of populace introduction and, furthermore, research holes, despite the fact that the fundamental center is to give the headings to future upgrade and advancement around there. This paper gives a deliberate study identified with this calculated model for the cutting edge of exploration, which is talked about in the predefined writing to date. The study is envisioned to be useful in examining the PSO algorithm in detail for the specialist. Likewise, the paper finds the proficiency of numerous quasi-random sequences (QRS) based on initialization approaches by looking at their exhibition analyzed for sixteen notable benchmark test problems. [ABSTRACT FROM AUTHOR]

Optimizing the heliostat field aiming strategy is crucial for maximizing thermal power production in solar power tower (SPT) plants while adhering to operational constraints. Although existing approaches can yield highly optimal solutions, their considerable computational cost makes them unsuitable for real-time optimization in large-scale scenes. This study introduces an efficient, intelligent, real-time optimization method based on a meta-heuristic algorithm to effectively and reliably manage SPT plant operations under varying solar conditions, such as cloud shadowing variations. To minimize redundant calculations, the real-time optimization problem is framed in a way that captures the operational continuity of the heliostat, which can be utilized to streamline the solution process. The proposed method is tested in a simulation environment that includes a heliostat field, cylindrical receiver, and cloud movement model. The results demonstrate that the algorithm presented in this paper offers higher intercept efficiency, improved robustness, and reduced optimization time in more complex scenes. [ABSTRACT FROM AUTHOR]

Since the past few years, several metaheuristic algorithms, inspired by the natural processes, have been introduced to solve different complex optimization problems. Studying and comparing the convergence, computational burden and statistical significance of those metaheuristics are helpful for future algorithmic development and their applications. This paper focuses on comparing the optimization performance of classical dragonfly algorithm (DA) and its seven different variants, i.e., hybrid memory-based dragonfly algorithm with differential evolution (DADE), quantum-behaved and Gaussian mutational dragonfly algorithm (QGDA), memory-based hybrid dragonfly algorithm (MHDA), chaotic dragonfly algorithm (CDA), biogeography-based Mexican hat wavelet dragonfly algorithm (BMDA), hybrid Nelder–Mead algorithm and dragonfly algorithm (INMDA) and hybridization of dragonfly algorithm and artificial bee colony (HDA) while solving 80 CEC-2021 benchmark problems. It is observed that the convergence rates of different variants of DA algorithm vary, and the corresponding computational times for such variations are also evaluated. This paper finally ranks DA and its variants according to their convergence efficiency and Friedman test. The DADE, QGDA, BMDA and DA evolve out as the most efficient algorithms for solving the considered CEC-2021 benchmark problems. [ABSTRACT FROM AUTHOR]

Recent advancements in computer science include some optimization models that have been developed and used in real applications. Some metaheuristic search/optimization algorithms have been tested to obtain optimal solutions to speed controller applications in self-driving cars. Some metaheuristic algorithms are based on social behaviour, resulting in several search models, functions, and parameters, and thus algorithm-specific strengths and weaknesses. The present paper proposes a fitness function on the basis of the mathematical description of proportional integrative derivate controllers showing that mean square error is not always the best measure when looking for a solution to the problem. The fitness developed in this paper contains features and equations from the mathematical background of proportional integrative derivative controllers to calculate the best performance of the system. Such results are applied to quantitatively evaluate the performance of twenty-one optimization algorithms. Furthermore, improved versions of the fitness function are considered, in order to investigate which aspects are enhanced by applying the optimization algorithms. Results show that the right fitness function is a key point to get a good performance, regardless of the chosen algorithm. The aim of this paper is to present a novel objective function to carry out optimizations of the gains of a PID controller, using several computational intelligence techniques to perform the optimizations. The result of these optimizations will demonstrate the improved efficiency of the selected control schema. [ABSTRACT FROM AUTHOR]

This paper applies the innovative idea of DLCI to PV array reconfiguration under various PSCs to capture the maximum output power of a PV generation system. DLCI is a hybrid algorithm that integrates multiple meta-heuristic algorithms. Through the competition and cooperation of the search mechanisms of different metaheuristic algorithms, the local exploration and global development of the algorithm can be effectively improved to avoid power mismatch of the PV system caused by the algorithm falling into a local optimum. A series of discrete operations are performed on DLCI to solve the discrete optimization problem of PV array reconfiguration. Two structures (DLCI-I and DLCI-II) are designed to verify the effect of increasing the number of sub-optimizers on the optimized performance of DLCI by simulation based on 10 cases of PSCs. The simulation shows that the increase of the number of sub-optimizers only gives a relatively small improvement on the DLCI optimization performance. DLCI has a significant effect on the reduction in the number of power peaks caused by PSC. The PV array-based reconstruction system of DLCI-II is reduced by 4.05%, 1.88%, 1.68%, 0.99% and 3.39%, when compared to the secondary optimization algorithms. [ABSTRACT FROM AUTHOR]

Metaheuristic optimization algorithms play a crucial role in optimization problems. However, the traditional identification methods have the following problems: (1) difficulties in nonlinear data processing; (2) high error rates caused by local stagnation; and (3) low classification rates resulting from premature convergence. This paper proposed a variant based on the gray wolf optimization algorithm (GWO) with chaotic disturbance, candidate migration, and attacking mechanisms, naming it the enhanced gray wolf optimizer (EGWO), to solve the problem of premature convergence and local stagnation. The performance of the EGWO was tested on IEEE CEC 2014 benchmark functions, and the results of the EGWO were compared with the performance of three GWO variants, five traditional and popular algorithms, and six recent algorithms. In addition, EGWO optimized the weights and biases of a multi-layer perceptron (MLP) and proposed an EGWO-MLP disease identification model; the model was tested on IEEE CEC 2014 benchmark functions, and EGWO-MLP was verified by UCI dataset including Tic-Tac-Toe, Heart, XOR, and Balloon datasets. The experimental results demonstrate that the proposed EGWO-MLP model can effectively avoid local optimization problems and premature convergence and provide a quasi-optimal solution for the optimization problem. [ABSTRACT FROM AUTHOR]

Recycling tasks are the most effective method for reducing waste generation, protecting the environment, and boosting the overall national economy. The productivity and effectiveness of the recycling process are strongly dependent on the cleanliness and precision of processed primary sources. However, recycling operations are often labor intensive, and computer vision and deep learning (DL) techniques aid in automatically detecting and classifying trash types during recycling chores. Due to the dimensional challenge posed by pre-trained CNN networks, the scientific community has developed numerous techniques inspired by biology, swarm intelligence theory, physics, and mathematical rules. This research applies a new meta-heuristic algorithm called the artificial hummingbird algorithm (AHA) to solving the waste classification problem based on feature selection. However, the performance of the AHA is barely satisfactory; it may be stuck in optimal local regions or have a slow convergence. To overcome these limitations, this paper develops two improved versions of the AHA called the AHA-ROBL and the AHA-OBL. These two versions enhance the exploitation stage by using random opposition-based learning (ROBL) and opposition-based learning (OBL) to prevent local optima and accelerate the convergence. The main purpose of this paper is to apply the AHA-ROBL and AHA-OBL to select the relevant deep features provided by two pre-trained models of CNN (VGG19 & ResNet20) to recognize a waste classification. The TrashNet dataset is used to verify the performance of the two proposed approaches (the AHA-ROBL and AHA-OBL). The effectiveness of the suggested methods (the AHA-ROBL and AHA-OBL) is compared with that of 12 modern and competitive optimizers, namely the artificial hummingbird algorithm (AHA), Harris hawks optimizer (HHO), Salp swarm algorithm (SSA), aquila optimizer (AO), Henry gas solubility optimizer (HGSO), particle swarm optimizer (PSO), grey wolf optimizer (GWO), Archimedes optimization algorithm (AOA), manta ray foraging optimizer (MRFO), sine cosine algorithm (SCA), marine predators algorithm (MPA), and rescue optimization algorithm (SAR). A fair evaluation of the proposed algorithms' performance is achieved using the same dataset. The performance analysis of the two proposed algorithms is applied in terms of different measures. The experimental results confirm the two proposed algorithms' superiority over other comparative algorithms. The AHA-ROBL and AHA-OBL produce the optimal number of selected features with the highest degree of precision. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to test the performance of the recently proposed weighted superposition attraction-repulsion algorithms (WSA and WSAR) on unconstrained continuous optimization test problems and constrained optimization problems. WSAR is a successor of weighted superposition attraction algorithm (WSA). WSAR is established upon the superposition principle from physics and mimics attractive and repulsive movements of solution agents (vectors). Differently from the WSA, WSAR also considers repulsive movements with updated solution move equations. WSAR requires very few algorithm-specific parameters to be set and has good convergence and searching capability. Through extensive computational tests on many benchmark problems including CEC’2015 and CEC’2020 performance of the WSAR is compared against WSA and other metaheuristic algorithms. It is statistically shown that the WSAR algorithm is able to produce good and competitive results in comparison to its predecessor WSA and other metaheuristic algorithms. [ABSTRACT FROM AUTHOR]

The no-free-lunch (NFL) theory has become the main reason of developing new metaheuristics in decades. Besides, the strict dimension mapping has been implemented in many population-based metaheuristics, especially the swarm-based metaheuristics. Regarding this problem, this paper proposes a new swarm-based metaheuristics called focus and shake algorithm (FSA). FSA has novel approach in the dimension mapping between the agent and its reference during the directed motion. It combines the strict dimension mapping called as focus approach and the randomized dimension mapping called as shake approach to enhance its exploration ability. FSA deploys two directed motions based on two references. The first reference is constructed based on the balance mixture between two finer agents while the second reference is constructed based on the balance mixture of the finest agent and a randomly picked agent. In the competing assessment, FSA competes with five brand new swarm-based metaheuristics: migration algorithm (MA), total interaction algorithm (TIA), lyrebird optimization algorithm (LOA), osprey optimization algorithm (OOA), and kookaburra optimization algorithm (KOA). The result exhibits that FSA is finer than MA, TIA, LOA, OOA, and KOA in 19, 21, 21, 19, and 20 functions out of 23 functions respectively. The result also shows that the superiority of FSA takes place in both unimodal and multimodal problems. In the future, the cross-dimension mapping can be more explored to develop finer swarm-based metaheuristics. [ABSTRACT FROM AUTHOR]

This paper introduces a novel metaheuristic named the stochastic shaking algorithm (SSA), which is rooted in swarm intelligence principles. The innovation lies in its unique utilization of iteration for selecting references during guided searches through a stochastic approach. The optimization process involves two sequential steps: the primary reference in the first step is the finest swarm member, while in the second step, it is the mean of all finer swarm members plus the finest one. This primary reference is then combined with a randomly chosen solution within the space, serving as the secondary reference. SSA undergoes evaluation in two contexts. The first involves assessing its performance using a set of 23 classic functions as a theoretical use case. The second involves tackling the economic load dispatch problem (ELD), a practical use case featuring a system with 13 generators of various energy resources. The study compares SSA against five other metaheuristics--One to One Based Optimization (OOBO), Kookaburra Optimization Algorithm (KOA), Language Education Optimization (LEO), Total Interaction Algorithm (TIA), and Walrus Optimization Algorithm (WaOA). Results indicate SSA's superiority over OOBO, KOA, LEO, TIA, and WaOA in 21, 13, 11, 16, and 14 functions out of 23 functions, respectively. Additionally, the evaluation of the economic load dispatch problem reveals intense competition among the six metaheuristics. [ABSTRACT FROM AUTHOR]

Multi‐objective optimization problems frequently appear in many diverse research areas and application domains. Metaheuristics, as efficient techniques to solve them, need to be easily accessible to users with different expertise and programming skills. In this context, metaheuristic optimization frameworks are helpful, as they provide popular algorithms, customizable components and additional facilities to conduct experiments. Due to the broad range of available tools, this paper presents a systematic evaluation and experimental comparison of 10 frameworks, covering from multi‐purpose, consolidated tools to recent libraries specifically designed for multi‐objective optimization. The evaluation is organized around seven characteristics: search components and techniques, configuration, execution, utilities, external support and community, software implementation and performance. An analysis of code metrics and a series of experiments serves to assess the last two features. Lesson learned and open issues are also discussed as part of the comparative study. The outcomes of the evaluation process reveal a contrasted support to recent advances in multi‐objective optimization, with a lack of novel algorithms and variety of metaheuristics other than evolutionary algorithms. The experimental comparison also reports significant differences in terms of both execution time and memory usage under demanding configurations. [ABSTRACT FROM AUTHOR]

Deep neural networks (DNNs) have evolved as a beneficial machine learning method that has been successfully used in various applications. Currently, DNN is a superior technique of extracting information from massive sets of data in a self-organized method. DNNs have different structures and parameters, which are usually produced for particular applications. Nevertheless, the training procedures of DNNs can be protracted depending on the given application and the size of the training set. Further, determining the most precise and practical structure of a deep learning method in a reasonable time is a possible problem related to this procedure. Meta-heuristics techniques, such as swarm intelligence (SI) and evolutionary computing (EC), represent optimization frames with specific theories and objective functions. These methods are adjustable and have been demonstrated their effectiveness in various applications; hence, they can optimize the DNNs models. This paper presents a comprehensive survey of the recent optimization methods (i.e., SI and EC) employed to enhance DNNs performance on various tasks. This paper also analyzes the importance of optimization methods in generating the optimal hyper-parameters and structures of DNNs in taking into consideration massive-scale data. Finally, several potential directions that still need improvements and open problems in evolutionary DNNs are identified. [ABSTRACT FROM AUTHOR]

In recent years, there is massive development of new metaheuristics as stochastic methods. Meanwhile, there is not any metaheuristics is powerful to handle all problems as stated in the no-free-lunch (NFL) theory. Based on this circumstance, this paper introduces a new swarm-based metaheuristics with the main strategy moving toward the resultant of better swarm members and avoiding the resultant of worse swarm members called group better-worse algorithm (GBWA). It consists of five searches: moving toward the best swarm member, moving toward the resultant of better swarm members, moving away from the resultant of worse swarm members, searching locally, and jumping to the opposite area. GBWA is then evaluated in three ways. The first evaluation is a comparative evaluation where GBWA is compared to five recent metaheuristics: coati optimization algorithm (COA), average and subtraction-based optimization (ASBO), clouded leopard optimization (CLO), total interaction algorithm (TIA), and osprey optimization algorithm (OOA). The second evaluation is the individual search evaluation. The third evaluation is hyperparameter test. The collection of 23 classic functions is chosen as the use case in all evaluations. The result of the first evaluation shows that GBWA is better than COA, ASBO, CLO, TIA, and OOA in 20, 21, 20, 21, and 21 functions consecutively. Meanwhile, the result of the second evaluation shows the equal contribution between the motion toward the best swarm member and the motion toward the resultant of better swarm members. [ABSTRACT FROM AUTHOR]

Introduction: The development of different optimization algorithms following the No Free-Lunch Theory has led the researchers to explore and develop new optimization algorithms which may be used to perform complicated mathematical solutions. Objectives: This paper proposes a novel Pigeon Nesting Algorithm (PNA), a single solution-based SI algorithm, which is capable of escaping the local optima due to the combination of nesting and homing behaviour of pigeon and provide accurate optimization results. Method: In order to check the validity of proposed PNA algorithm, it has been applied to the 29 benchmark functions and compared with the existing single solution and population-based meta-heuristic algorithms. In order to check the application PNA for SHM of a practical structure, its performance for damage detection of ASCE Benchmark structure using stiffness-based objective function has been compared with other well-known optimization algorithms. Results: The PNA gives good competition to the other algorithms when tested for the 29 benchmarks functions. PNA proves to be a robust algorithm for health monitoring of ASCE benchmark structure as it shows an approximate error of 1%. It has also been found that the algorithm can be used for detecting damage even in the presence of noise of 5%. Conclusion: The algorithm also outperforms other single solution-based algorithms when used for optimization of design problems. [ABSTRACT FROM AUTHOR]

A new swarm-based metaheuristic, namely the enriched coati osprey algorithm (ECOA), is proposed in this paper. As its name suggests, ECOA hybridizes two new metaheuristics, the coati optimization algorithm (COA) and the osprey optimization algorithm (OOA). ECOA is constructed by five searches performed sequentially by the swarm members. The first three are directed searches, while the last two are neighborhood searches. All three directed searches are adopted from COA and OOA. Meanwhile, the four-bordered neighborhood search is developed based on a new approach. During the assessment, ECOA was challenged to overcome the set of 23 functions and contended with five new metaheuristics: total interaction algorithm (TIA), golden search optimization (GSO), average and subtraction-based optimization (ASBO), COA, and OOA. The result shows that ECOA outperforms TIA, GSO, ASBO, COA, and OOA in 16, 23, 18, 21, and 21 functions. Meanwhile, the individual search test result shows that the directed searches perform better than the neighborhood searches. Moreover, the directed search toward the best member becomes the most dominant search. [ABSTRACT FROM AUTHOR]

Optimization problems are prevalent in almost all areas and hence optimization algorithms are crucial for a myriad of real-world applications. Deterministic optimization algorithms tend to be computationally costly and time-consuming. Hence, heuristic and metaheuristic algorithms are more favoured as they provide near-optimal solutions in an acceptable amount of time. Swarm intelligence algorithms are being increasingly used for optimization problems owing to their simplicity and good performance. The Dragonfly Algorithm (DA) is one which is inspired by the swarming behaviours of dragonflies, and it has been proven to have a superior performance than other algorithms in multiple applications. Hence, it is worth considering its application to the traveling salesman problem which is a predominant discrete optimization problem. The original DA is only suitable for solving continuous optimization problems and, although there is a binary version of the algorithm, it is not easily adapted for solving discrete optimization problems like TSP. We have previously proposed a discrete adapted DA algorithm suitable for TSP. However, it has low effectiveness, and it has not been used for large TSP problems. In this paper, we propose an optimized discrete adapted DA by using the steepest ascent hill climbing algorithm as a local search. The algorithm is applied to a TSP problem modelling a package delivery system in the Kuala Lumpur area and to benchmark TSP problems, and it is found to have a higher effectiveness than the discrete adapted DA and some other swarm intelligence algorithms. It also has a higher efficiency than the discrete adapted DA. [ABSTRACT FROM AUTHOR]

Four-bar linkages are one of the most widely used mechanisms in industries. This paper presents a comparative study on the accuracy and efficiency of the optimum synthesis of path-generating four-bar linkages using five metaheuristic optimization algorithms. The utilized metaheuristic methods included two swarm intelligence-based algorithms, i.e., particle swarm optimization and hybrid particle swarm optimization, and three evolutionary-based algorithms, i.e., differential evolution, ensemble of parameters and mutation strategies in differential evolution, and linearly ensemble of parameters and mutation strategies in differential evolution. The objective function to be minimized is the sum of squares of the distance between the generated points and the precision points of a coupler point. The optimal design of four-bar linkages must meet the Grashof's criteria and exhibit sequential constraints that can prevent the occurrence of order defect. This study investigated five representative cases of the dimensional synthesis of four-bar path generators with and without prescribed timing and compared the optimal solutions of the utilized five metaheuristic methods to those of previously reported algorithms in literature. The improved metaheuristic methods exhibited superior optimal solution and enhanced reliability compared to the original methods. Moreover, three improved metaheuristic methods were not only easy implemented, but also more efficient for solving the optimal synthesis problems, particularly for high dimensional problems. [ABSTRACT FROM AUTHOR]

This paper introduces a new evolutionary computing method inspired by the seed transmission process of garden balsam. Garden balsam, a beautiful and attractive flower, randomly ejects the seeds within a certain range by virtue of mechanical force originating from cracking of mature seed pods, which is different from natural expansion of most species of plants. The seeds scattered to suitable growth area will have greater reproductive capacity in the next generation, followed by iteration until the most suitable point for growth in a particular space is eventually found. This phenomenon can more intuitively show the process of searching the problem solution space in the optimization problem. The garden balsam optimization algorithm proposed in this paper incorporates two different types of search processes and has a mechanism to maintain population diversity. Through the optimization experiment on 24 constrained optimization problems, the results obtained by using this algorithm are compared with those of some known meta-heuristic search algorithms. The statistical analysis of the experimental results has been implemented by Friedman rank test and Holm–Sidak test. The comparison results verify the effectiveness of the algorithm. [ABSTRACT FROM AUTHOR]

Power system stabilizers (PSSs) are extensively used in generator units to enhance the transient stability of the power system. Hence, optimal tuning and placement of the parameters of PSS are crucial for the efficiency of the stabilizer. Researchers have been proposed many methods for optimizing such parameters. In this paper, the Crow search algorithm (CSA), which is based on the intelligence of crows, was employed in a single-machine infinite-bus (SMIB) system to determine the optimum parameters of the PSS. Modeling and simulation of the SMIB and designing of PSS were made by MATLAB/Simulink. PSSs are designed to minimize low-frequency oscillations such as power angle, rotor speed, and field current deviation following a large disturbance. Our objective in this study is the minimization of the rotor speed deviation. The results of the simulations proved the effectiveness and robustness of the optimization process compared to other metaheuristic algorithms such as particle swarm optimization (PSO) and genetic algorithm (GA). When compared to the performance attained by the GA-based and PSO-based PSS controller designs, the simulations show that the CSA-based PSS delivers a far better dynamic response when the system is disrupted. The CSA-based PSS settles 48.1% faster than the PSO-based PSS and 55.7% faster than the GA-based PSS. CSA has just 2 parameters to adjust, making it much easier to implement than other methods. These parameters for PSO and GA are 4 and 6. When CSA-based PSS is used in the SMIB system, overshoot and low-frequency oscillations are also significantly reduced compared to other methods. [ABSTRACT FROM AUTHOR]

Bat Algorithm, is an evolutionary computation technique based on the echolocation behaviour of microbats while looking for their prey. It is used to perform global optimization. It was developed by Xin-She Yang in 2010. Since then, it has extensively been applied in various optimization problems because of its simple structure and robust performance. Continuous, discrete, or binary, many variants were proposed over the last few years, with applications to solve real-world cases in different fields. Yet, it has one major drawback: its premature convergence due to a lack in its exploration ability. In this paper, we introduce a selection-based improvement and three other modifications to the standard version of this metaheuristic in order to enhance the diversification and intensification capabilities of the algorithm. The newly proposed method has been then tested on 20 standard benchmark functions and the CEC2005 benchmark suit. Some non-parametric statistical tests were also used to compare the New Bat algorithm with other algorithms, and results indicate that the new method is very competitive and outperforms some of the state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

Cloud computing represents relatively new paradigm of utilizing remote computing resources and is becoming increasingly important and popular technology, that supports on-demand (as needed) resource provisioning and releasing in almost real-time. Task scheduling has a crucial role in cloud computing and it represents one of the most challenging issues from this domain. Therefore, to establish more efficient resource employment, an effective and robust task allocation (scheduling) method is required. By using an efficient task scheduling algorithm, the overall performance and service quality, as well as end-users experience can be improved. As the number of tasks increases, the problem complexity rises as well, which results in a huge search space. This kind of problem belongs to the class of NP-hard optimization challenges. The objective of this paper is to propose an approach that is able to find approximate (near-optimal) solution for multi-objective task scheduling problem in cloud environment, and at the same time to reduce the search time. In the proposed manuscript, we present a swarm-intelligence based approach, the hybridized bat algorithm, for multi-objective task scheduling. We conducted experiments on the CloudSim toolkit using standard parallel workloads and synthetic workloads. The obtained results are compared to other similar, metaheuristic-based techniques that were evaluated under the same conditions. Simulation results prove great potential of our proposed approach in this domain. [ABSTRACT FROM AUTHOR]

Formation of effective teams of experts has played a crucial role in successful projects especially in social networks. In this paper, a new particle swarm optimization (PSO) algorithm is proposed for solving a team formation optimization problem by minimizing the communication cost among experts. The proposed algorithm is called by improved particle optimization with new swap operator (IPSONSO). In IPSONSO, a new swap operator is applied within particle swarm optimization to ensure the consistency of the capabilities and the skills to perform the required project. Also, the proposed algorithm is investigated by applying it on ten different experiments with different numbers of experts and skills; then, IPSONSO is applied on DBLP dataset, which is an example for benchmark real-life database. Moreover, the proposed algorithm is compared with the standard PSO to verify its efficiency and the effectiveness and practicality of the proposed algorithm are shown in our results. [ABSTRACT FROM AUTHOR]

This paper presents a powerful swarm intelligence metaheuristic optimization algorithm called Dynamic Cat Swarm Optimization. The formulation is through modifying the existing Cat Swarm Optimization Algorithm. The original Cat Swarm Optimization suffers from the shortcoming of "premature convergence," which is the possibility of entrapment in local optima which usually happens due to the off balance between exploration and exploitation phases. Therefore, the proposed algorithm suggests a new method to provide a proper balance between these phases by modifying the selection scheme and the seeking mode of the algorithm. To evaluate the performance of the proposed algorithm, 23 classical test functions, 10 modern test functions (CEC 2019) and a real-world scenario are used. In addition, the dimension-wise diversity metric is used to measure the percentage of the exploration and exploitation phases. The optimization results show the effectiveness of the proposed algorithm, which ranks first compared to several well-known algorithms available in the literature. Furthermore, statistical methods and graphs are also used to further confirm the outperformance of the algorithm. Finally, the conclusion and future directions to further improve the algorithm are discussed. [ABSTRACT FROM AUTHOR]

As a meta-heuristic algorithm, the ant colony algorithm has been successfully used to solve various combinatorial optimization problems. However, the existing algorithm that takes the power of ants to solve distributed constraint optimization problems (ACO_DCOP) is easy to fall into local optima. To deal with this issue, this paper presents an adaptive ant colony algorithm based on local information entropy to solve distributed constraint optimization problems, named LIEAD. In LIEAD, the local information entropy is introduced to help agents adaptively select the pheromone update strategy and value selection strategy, which improves the convergence speed and the quality of the solution. Moreover, a restart mechanism is designed to break the accumulation state of pheromone, which increases the population diversity and helps the algorithm jump out of the local optima. The extensive experimental results indicate that LIEAD can significantly outperform ACO_DCOP and is competitive with the state-of-the-art DCOPs algorithms. [ABSTRACT FROM AUTHOR]

Meta-heuristic algorithms have shown promising results in solving various optimization problems. The crow search algorithm (CSA) is a new and effective meta-heuristic algorithm that emulates crows' intelligent group behavior in nature. However, it suffers from several problems, such as trapping into local optimum and premature convergence. This paper proposes an improved crow search algorithm (ICSA), which has been tested and evaluated by a set of well-known benchmark functions. A new update mechanism that uses the merits of the global best position to move toward the best position is proposed. This mechanism increases the convergence of the algorithm and improves its local search-ability. Twenty benchmark functions are used to evaluate the performance of the proposed ICSA. Moreover, the ICSA algorithm is compared with the conventional CSA and other meta-heuristic algorithms such as particle swarm optimization (PSO), dragonfly algorithm (DA), grasshopper optimization algorithm (GOA), gray wolf optimizer (GWO), moth-flame optimization (MFO), and sine-cosine algorithm (SCA). The experimental result shows that the proposed ICSA algorithm has produced promising results and outperformed conventional CSA and other meta-heuristic algorithms. Also, the proposed ICSA has a more robust convergence for optimizing objective functions in terms of solution accuracy and efficiency. [ABSTRACT FROM AUTHOR]

The problem with using microarray technology to detect diseases is that not each is analytically necessary. The presence of non-essential gene data adds a computing load to the detection method. Therefore, the purpose of this study is to reduce the high-dimensional data size by determining the most critical genes involved in Alzheimer's disease progression. A study also aims to predict patients with a subset of genes that cause Alzheimer's disease. This paper uses feature selection techniques like information gain (IG) and a novel metaheuristic optimization technique based on a swarm's algorithm derived from nomadic people's behavior (NPO). This suggested method matches the structure of these individuals' lives movements and the search for new food sources. The method is mostly based on a multi-swarm method; there are several clans, each seeking the best foraging opportunities. Prediction is carried out after selecting the informative genes of the support vector machine (SVM), frequently used in a variety of prediction tasks. The accuracy of the prediction was used to evaluate the suggested system's performance. Its results indicate that the NPO algorithm with the SVM model returns high accuracy based on the gene subset from IG and NPO methods. [ABSTRACT FROM AUTHOR]

Constructal T-shaped porous fins transfer better heat compared to the rectangular counterparts by improving the heat flow through the low resistive links. This type of fins can be used in aerospace engines which demand faster removal of heat without adding extra weight of the overall assembly. Here, in this study, three powerful nature-inspired metaheuristic algorithms such as particle swarm optimization, gravitational search algorithm, and Firefly algorithm have been used to optimize the dominant thermo physical as well as geometric parameters which are responsible for transferring heat at faster rates from the fin body satisfying a volume constraint. The temperature distribution along the stem and the flange has been plotted, and the effect of important parameters on the efficiency has been determined. Three different volumes are selected for the analysis, and the results have shown marked improvement in the optimized heat transfer rate. Particle swarm optimization has reported an increase of 0.81%, while Firefly algorithm reports 0.83% improvement as we increase the fin volume from 500 to 1000 and 0.19% (by PSO) and 0.4% (by FA) as the volume increases from 1000 to 1500. The paper also presents a scheme of reducing the computational effort required by the algorithms to converge around the optimum point. While a reduction of 14.36% computational effort has been achieved in particle swarm optimization's convergence time, Firefly algorithm took 24.64% less time to converge at the near-optimum point. While particle swarm optimization has converged at better optimal points compared to Firefly algorithm and Gravitational search algorithm, Gravitational search algorithm has outperformed the two algorithms in terms of computational time. Gravitational search algorithm took 61.72 and 29.33% less time to converge as compared to particle swarm optimization and Firefly algorithm, respectively. [ABSTRACT FROM AUTHOR]

A swarm-based metaheuristic algorithm, like artificial bee colony (ABC), embraces four key elements of collective intelligence: positive feedback, negative feedback, multiple interactions, and fluctuation. Fluctuation refers to population diversity which can be measured using dimension-wise diversity. This paper performed component-wise analysis of ABC algorithm using diversity measurement. The analysis revealed scout bees component as counterproductive and onlooker bees component with poor global search ability. Subsequently, an ABC algorithm without scout bees component and modified onlooker bees component is proposed in this paper. The effectiveness and efficiency of the proposed ScoutlessABC is validated on test suite of a dozen of benchmark functions. To further evaluate the performance, ScoutlessABC is employed on the parameter training problem of fuzzy neural network for solving eight classification problems. The experimental results show that ScoutlessABC maintains strong convergence ability than the original ABC algorithm. Overall, this study has two major contributions: (a) an effective component-wise analysis approach using diversity measurement and (b) a simplified and modified ABC variant with enhanced search efficiency. [ABSTRACT FROM AUTHOR]

Swarm intelligence is all about developing collective behaviours to solve complex, ill-structured and large-scale problems. Efficiency in collective behaviours depends on how to harmonise the individual contributors so that a complementary collective effort can be achieved to offer a useful solution. The main points in organising the harmony remain as managing the diversification and intensification actions appropriately, where the efficiency of collective behaviours depends on blending these two actions appropriately. In this paper, a hybrid bee algorithm is presented, which harmonises bee operators of two mainstream well-known swarm intelligence algorithms inspired of natural honeybee colonies. The parent algorithms have been overviewed with many respects, strengths and weaknesses are identified, first, and the hybrid version has been proposed, next. The efficiency of the hybrid algorithm is demonstrated in comparison with the parent algorithms in solving two types of numerical optimisation problems; (1) a set of well-known functional optimisation benchmark problems and (2) optimising the weights of a set of artificial neural network models trained for medical classification benchmark problems. The experimental results demonstrate the outperforming success of the proposed hybrid algorithm in comparison with two original/parent bee algorithms in solving both types of numerical optimisation benchmarks. [ABSTRACT FROM AUTHOR]

Slime Mould Algorithm (SMA) has recently received much attention from researchers because of its simple structure, excellent optimisation capabilities, and acceptable convergence in dealing with various types of complex real-world problems. this study aims to retrieve, identify, summarise and analyse critical studies related to SMA development. Based on this, 98 SMA-related studies in the Web of Science were retrieved, selected, and identified. The two main review vectors were advanced versions of SMAs and application domains. First, we counted and analysed various advanced versions of SMAs, summarised, classified, and discussed their improvement methods and directions. Secondly, we sort out the application domains of SMA and analyse the role, development status, and shortcomings of SMA in each domain. A survey based on the existing literature shows that SMAs clearly outperform some established metaheuristics in terms of speed and accuracy in handling various benchmark problems and solving multiple realistic optimization problems. This review not only suggests possible future directions in the field but, due to the inclusion of graphical and tabular comparisons of various properties, also provides future researchers with a comprehensive source of information about SMA and advanced versions of SAMs and the scope of adaptation for multiple application domains. [ABSTRACT FROM AUTHOR]

In a cloud environment, scheduling problem as an NP-complete problem can be solved using various metaheuristic algorithms. The metaheuristic algorithms are very popular for scheduling tasks because of their effectiveness. A bacterial foraging is a swarm intelligence algorithm inspired by the foraging and chemotactic phenomenon of bacteria. This paper proposes a task scheduling algorithm based on bacterial foraging optimization to reduce the idle time of virtual machines whereas the load balancing and reducing of runtime have occurred. The Cloudsim toolkit has assessed the performance of the proposed method in comparison with some scheduling algorithms. According to the obtained results, the makespan and energy consumption were reduced by using the proposed algorithm. [ABSTRACT FROM AUTHOR]

Being sensitive to initial position and noise is the key problem that must be solved in point cloud registration. To improve the overall performance of registration methods, a point cloud registration method based on the Dark Forest Algorithm is proposed in this paper. The introduction of swarm intelligence enhances the adaptability of the registration method to the initial position and improves the robustness of the point cloud registration system. Furthermore, the application of the Dark Forest Algorithm with four capability enhancement strategies: the hierarchical elite, civilization self-decision, suspicion chain, and technology explosion has improved the comprehensive competitiveness in point cloud registration. The mentioned strategies have brought a great positive impact on the registration methods in solving the far initial position, breaking away from the local optimal solution, and weakening the noise interference. The paper aims to provide the Dark Forest Algorithm and the point cloud registration method based on it, which are elaborated on in detail and compared to other existing algorithms to prove the comprehensive performance, respectively. Then, the point cloud registration experiment for coal-wall point clouds was carried out and the results indicate that the proposed registration algorithm is better than other algorithms for standard point cloud dataset and coal-wall point cloud, which demonstrates that the proposed registration method has strong potential competitiveness. • Proposed a point cloud registration based on a novel meta-heuristic algorithm. • Dark Forest Algorithm is proposed with the higher accuracy and stronger adaptability. • Cloud registration based on the DFA demonstrates potential competitiveness. [ABSTRACT FROM AUTHOR]

Aiming at the problem that Ant Colony Optimization (ACO) is subject primarily to the parameters, we propose a hybrid algorithm SOA-ACO-2Opt to optimize the ACO parameter combination through Seagull Optimization Algorithm (SOA) to strengthen ACO's search capability. To obtain a uniform initial distribution of the ACO parameter combination, we incorporated the Kent Chaos Map (KCM) to randomly initialize the seagull's position, reducing the tendency of SOA to fall into the local optimum. To avoid slow calculation speed and premature convergence of ACO, we improved the adaptive multi-population mechanism to reduce repeated redundant calculations and used the ϵ − g r e e d y and default strategy, respectively, to update the ants' position. 2Opt is applied to find shorter paths in each iteration. In addition, when AUV navigates on the planned path, it may encounter obstacles. Therefore, this paper proposes an autonomous obstacle avoidance algorithm based on forward-looking sonar to ensure safety during tasks. SOA-ACO-2Opt is verified against twelve different problems extracted from TSPLIB and compared with some state-of-the-art algorithms. Furthermore, sea trials were carried out for several representative marine engineering applications of TSP and obstacle avoidance. Experimental results show that this work can significantly improve AUV's work efficiency and intelligence and protect the AUV's safety. [Display omitted] • A hybrid algorithm SOA-ACO-2Opt is proposed to solve TSP. • A multi-population mechanism is used to reduce redundant computation and avoid early convergence. • The desired-path-based avoidance strategy is efficient and of low complexity. • The proposed algorithm is practical and efficient for AUV engineering applications. [ABSTRACT FROM AUTHOR]

In recent years, there have been notable advancements in the theoretical research of existing meta-heuristic algorithms and in the development of novel algorithms. However, the research on the definition and construction methods of the so-called "mutation" operator, a concept widely used in existing meta-heuristic algorithms, remains notably insufficient. In addition, how to directly construct a meta-heuristic algorithm under the guidance of stability and invariance analysis continues to pose a challenge that has yet to resolve. This paper carefully investigates and rigorously defines the concepts of "mutation operator" and "mutation-driven meta-heuristic algorithm" as found in the literature. According to these definitions, a novel meta-heuristic algorithm, called Multi-direction guided Mutation-driven Stable swarm Intelligence algorithm with Translation and Rotation invariance (M2SITRI) is proposed, and the corresponding mutation operator is carefully designed based on the analysis of translation invariance, rotation invariance, order-1 stability, and order-2 stability. The stability and invariance properties of the M2SITRI algorithm are validated through numerical simulations, and its superior solving performance is demonstrated by benchmarking it against several other well-known existing meta-heuristic algorithms across a variety of test problems. • Mutation operator and mutation-driven meta-heuristic algorithm concepts are defined. • A novel translation and rotationally invariant meta-heuristic algorithm termed M2SITRI is proposed. • The invariance and stability properties and the excellent solving performance of M2SITRI algorithm are verified. [ABSTRACT FROM AUTHOR]

Clustering is a fundamental data analysis task that presents challenges. Choosing proper initialization centroid techniques is critical to the success of clustering algorithms, such as k-means. The current work investigates six established methods (random, Forgy, k-means++, PCA, hierarchical clustering, and naive sharding) and three innovative swarm intelligence-based approaches--Spider Monkey Optimization (SMO), Whale Optimization Algorithm (WOA) and Grey Wolf Optimizer (GWO)--for k-means clustering (SMOKM, WOAKM, and GWOKM). The results on ten well-known datasets strongly favor swarm intelligence-based techniques, with SMOKM consistently outperforming WOAKM and GWOKM. This finding provides critical insights into selecting and evaluating centroid techniques in k-means clustering. The current work is valuable because it provides guidance for those seeking optimal solutions for clustering diverse datasets. Swarm intelligence, especially SMOKM, effectively generates distinct and well-separated clusters, which is valuable in resource-constrained settings. The research also sheds light on the performance of traditional methods such as hierarchical clustering, PCA, and k-means++, which, while promising for specific datasets, consistently underperform swarm intelligence-based alternatives. In conclusion, the current work contributes essential insights into selecting and evaluating initialization centroid techniques for k-means clustering. It highlights the superiority of swarm intelligence, particularly SMOKM, and provides actionable guidance for addressing various clustering challenges. [ABSTRACT FROM AUTHOR]

The Dung beetle optimization (DBO) algorithm, devised by Jiankai Xue in 2022, is known for its strong optimization capabilities and fast convergence. However, it does have certain limitations, including insufficiently random population initialization, slow search speed, and inadequate global search capabilities. Drawing inspiration from the mathematical properties of the Sinh and Cosh functions, we proposed a new metaheuristic algorithm, Sinh–Cosh Dung Beetle Optimization (SCDBO). By leveraging the Sinh and Cosh functions to disrupt the initial distribution of DBO and balance the development of rollerball dung beetles, SCDBO enhances the search efficiency and global exploration capabilities of DBO through nonlinear enhancements. These improvements collectively enhance the performance of the dung beetle optimization algorithm, making it more adept at solving complex real-world problems. To evaluate the performance of the SCDBO algorithm, we compared it with seven typical algorithms using the CEC2017 test functions. Additionally, by successfully applying it to three engineering problems, robot arm design, pressure vessel problem, and unmanned aerial vehicle (UAV) path planning, we further demonstrate the superiority of the SCDBO algorithm. [ABSTRACT FROM AUTHOR]

A novel metaheuristic algorithm is proposed in this paper, namely stochastic komodo algorithm (SKA). This proposed algorithm is an improved version of Komodo mlipir algorithm (KMA), which is inspired by the behaviour of Komodo during foraging and mating. The improvement is conducted by simplifying the basic form of KMA. Like KMA, it consists of three types of Komodo: big male, female, and small male. Male Komodo focuses on intensification. On the other side, females conduct diversification or intensification based on the search space radius. It eliminates sorting mechanism at the beginning of the iteration. Rather than determined from the quality (fitness score), the distribution of the types of Komodo is conducted stochastically at the beginning of every iteration. This proposed algorithm is then tested by using ten functions. Five functions are unimodal, while the five others are multimodal. The proposed algorithm is also compared with several well-known algorithms: football game-based optimization, hide objects game optimization, cloud-theory-based simulated annealing, harmony search, and KMA. The result shows that this proposed algorithm is very competitive compared with these benchmark algorithms in both unimodal and multimodal functions. A female-dominant formation is proven to achieve optimal result. [ABSTRACT FROM AUTHOR]

Everyday, a large number of complex scientific and industrial problems involve finding an optimal solution in a large solution space. A challenging task for several optimizations is not only the combinatorial operation but also the constraints of available devices. This paper proposes a novel optimization algorithm, namely the compact bat algorithm (cBA), to use for the class of optimization problems involving devices which have limited hardware resources. A real-valued prototype vector is used for the probabilistic operations to generate each candidate for the solution of the optimization of the cBA. The proposed cBA is extensively evaluated on several continuous multimodal functions as well as the unequal clustering of wireless sensor network (uWSN) problems. Experimental results demonstrate that the proposed algorithm achieves an effective way to use limited memory devices and provides competitive results. [ABSTRACT FROM AUTHOR]

Firefly algorithm is a swarm based metaheuristic algorithm designed for continuous optimization problems. It works by following better solutions and also with a random search mechanism. It has been successfully used in different problems arising in different disciplines and also modified for discrete problems. Unlike its easiness to understand and to implement; its effectiveness is highly affected by the parameter values. In addition modifying the search mechanism may give better performance. Hence different modified versions are introduced to overcome its limitations and increase its performance. In this paper, the modifications done on firefly algorithm for continuous optimization problems will be reviewed with a critical analysis. A detailed discussion on the modifications with possible future works will also be presented. In addition a comparative study will be conducted using forty benchmark problems with different dimensions based on ten base functions. The result shows that some of the modified versions produce superior results with a tradeoff of high computational time. Hence, this result will help practitioners to decide which modified version to apply based on the computational resource available and the sensitivity of the problem. [ABSTRACT FROM AUTHOR]

In the past few decades, metaheuristic algorithms (MA) have been developed tremendously and have been successfully applied in many fields. In recent years, a large number of new MA have been proposed. Slime mould algorithm (SMA) is a novel swarm-based intelligence optimization algorithm. SMA solves the optimization problem by imitating the foraging and movement behavior of slime mould. It can effectively obtain a promising global optimal solution. However, it still suffers some shortcomings such as the unstable convergence speed, the imprecise search accuracy, and incapability of identifying a local optimal solution when faced with complicated optimization problems. With the purpose of overcoming the shortcomings of SMA, this paper proposed a multistrategy enhanced version of SMA called ESMA. The three enhanced strategies are chaotic initialization strategy (CIS), orthogonal learning strategy (OLS), and boundary reset strategy (BRS). The CIS is used to generate an initial population with diversity in the early stage of ESMA, which can increase the convergence speed of the algorithm and the quality of the final solution. Then, the OLS is used to discover the useful information of the best solutions and offer a potential search direction, which enhances the local search ability and raises the convergence rate. Finally, the BRS is used to correct individual positions, which ensures the population diversity and enhances the overall search capabilities of ESMA. The performance of ESMA was validated on the 30 IEEE CEC2014 functions and three IIR model identification problems, compared with other nine well-regarded and state-of-the-art algorithms. Simulation results and analysis prove that the ESMA has a superior performance. The three strategies involved in ESMA have significantly improved the performance of the basic SMA. [ABSTRACT FROM AUTHOR]

Metaheuristics play a critical role in solving optimization problems, and most of them have been inspired by the collective intelligence of natural organisms in nature. This paper proposes a new metaheuristic algorithm inspired by gorilla troops' social intelligence in nature, called Artificial Gorilla Troops Optimizer (GTO). In this algorithm, gorillas' collective life is mathematically formulated, and new mechanisms are designed to perform exploration and exploitation. To evaluate the GTO, we apply it to 52 standard benchmark functions and seven engineering problems. Friedman's test and Wilcoxon rank‐sum statistical tests statistically compared the proposed method with several existing metaheuristics. The results demonstrate that the GTO performs better than comparative algorithms on most benchmark functions, particularly on high‐dimensional problems. The results demonstrate that the GTO can provide superior results compared with other metaheuristics. [ABSTRACT FROM AUTHOR]

Neural networks have been widely used as compensational models for aircraft control designs and as surrogate models for other optimizations. In the case of tiltrotor aircraft, the total number of aircraft states and controls is much greater than that of both traditional fixed-wings and helicopters. This requires, in general, a huge amount of training data for the network to reach a satisfactory approximation precision and makes the network size rise considerably. To solve the practical problem of reducing the size of the approximating network, efforts have to be made in the efficient utilization of the limited amount of training data. This work presents the methodology of optimizing the sample pattern of the training data set by adopting the metaheuristic algorithm of the particle swarm optimizer improved by the fourth-order Runge–Kutta algorithm. A 6-degree-of-freedom nonlinear flight dynamics model of the tiltrotor aircraft is derived, along with its approximation radial basis function neural network. An example case of approximating a highly nonlinear function is studied to illustrate the principle and main parameters of the optimizer, and the approximation performance of the time-domain response of the unstable nonlinear system is revealed by the study of a Van der Pol oscillator. Then, the presented method is applied to the modeled tiltrotor aircraft for its early and late conversion modes. The optimization scheme shows great improvement in both cases, as the function approximation error is reduced significantly. [ABSTRACT FROM AUTHOR]

In this work, the applicability of a Firefly Algorithm (FA) to the real problem of the minimum cost of a detailed design for steel frames is studied. To reduce the calculation time, which is a common problem of meta-heuristic algorithms when they are used to solve real design cases, and to better suit the characteristics of the algorithm, a parallel migration strategy has been implemented and tested. As it is well known that the performance of any metaheuristic algorithm depends on the chosen value of its parameters, an extensive sensitivity analysis has been carried out. This not only serves to improve performance but also provides information on how it depends on the values of these parameters. With the information obtained from this analysis, and in order to achieve the robust behavior of the algorithm, a parameter control strategy has also been implemented and tested. Finally, a study demonstrating the close dependence between one of the parameters and the number of variables considered in the examples has been carried out. As a result of this final study, a simple expression is proposed that provides the minimum necessary population based on the number of variables in the problem. [ABSTRACT FROM AUTHOR]

Optimization is an important and fundamental challenge to solve optimization problems in different scientific disciplines. In this paper, a new stochastic nature-inspired optimization algorithm called Pelican Optimization Algorithm (POA) is introduced. The main idea in designing the proposed POA is simulation of the natural behavior of pelicans during hunting. In POA, search agents are pelicans that search for food sources. The mathematical model of the POA is presented for use in solving optimization issues. The performance of POA is evaluated on twenty-three objective functions of different unimodal and multimodal types. The optimization results of unimodal functions show the high exploitation ability of POA to approach the optimal solution while the optimization results of multimodal functions indicate the high ability of POA exploration to find the main optimal area of the search space. Moreover, four engineering design issues are employed for estimating the efficacy of the POA in optimizing real-world applications. The findings of POA are compared with eight well-known metaheuristic algorithms to assess its competence in optimization. The simulation results and their analysis show that POA has a better and more competitive performance via striking a proportional balance between exploration and exploitation compared to eight competitor algorithms in providing optimal solutions for optimization problems. [ABSTRACT FROM AUTHOR]