Enhanced gorilla troops optimizer powered by marine predator algorithm: global optimization and engineering design

A new optimization method based on COOT bird natural life model

Optimization algorithms are one of the effective stochastic methods in solving optimization problems. In this paper, a new swarm-based algorithm called Northern Goshawk Optimization (NGO) algorithm is presented that simulates the behavior of northern goshawk during prey hunting. This hunting strategy includes two phases of prey identification and the tail and chase process. The various steps of the proposed NGO algorithm are described and then its mathematical modeling is presented for use in solving optimization problems. The ability of NGO to solve optimization problems is evaluated on sixty-eight different objective functions. To analyze the quality of the results, the proposed NGO algorithm is compared with eight well-known algorithms, particle swarm optimization, genetic algorithm, teaching-learning based optimization, gravitational search algorithm, grey wolf optimizer, whale optimization algorithm, tunicate swarm algorithm, and marine predators algorithm. In addition, for further analysis, the proposed algorithm is also employed to solve four engineering design problems. The results of simulations and experiments show that the proposed NGO algorithm, by creating a proper balance between exploration and exploitation, has an effective performance in solving optimization problems and is much more competitive than similar algorithms.

Flexible AC transmission systems (FACTS) and optimal power-flow (OPF) solutions play an important role in solving power operation problems. The volatile nature of the power generation profiles from renewable energy sources, solar and wind systems, and determining the optimal locations and sizes of FACTS devices increase the complexity of the OPF problems in modern power network models, such as transmission power loss, power generation operation cost and voltage deviation, as a highly nonlinear-nonconvex optimization problem. Therefore, this article introduces and employs four new independent, reliable and efficient optimization algorithms inspired by nature and biological nature, namely: Slime Mould Algorithm (SMA), Artificial Ecosystem-based Optimization (AEO), Marine Predators Algorithm (MPA) and Jellyfish Search (JS), for solving both multi- and single-OPF objective problems for a power network incorporating FACTS and stochastic renewable energy sources. The proposed new metaheuristic optimization techniques are compared to the common and available alternatives in the literature, Particle Swarm Optimization (PSO), Moth Flame Optimization (MFO) and Grey Wolf Optimizer (GWO), using IEEE 30-bus test system. To consider and address the challenges of the OPF in modern power network models, the proposed optimization techniques tested under different operation cases such as an increasing in the load, with and without FCTAS and renewable energy sources, different renewable energy sources locations on the network. The result showed that the MPA, SMA, JS and AEO algorithms are more effective solvers for the OPF problems cases compared to the PSO, GWO and MFO algorithms. For example, the AEO obtained 0.0844 p.u. in case of minimizing the voltage deviation compared to 0.1155 p.u. for PSO, which means that the AEO algorithm improved the voltage deviation term by 27% compared to the PSO algorithm.

A novel physical based meta-heuristic optimization method known as Lightning Attachment Procedure Optimization

PurposeSea Lion Optimization (SLnO) algorithm involves the ability of exploration and exploitation phases, and it is able to solve combinatorial optimization problems. For these reasons, it is considered a global optimizer. The scheduling operation is completed by imitating the hunting behavior of sea lions.Design/methodology/approachCloud computing (CC) is a type of distributed computing, contributory in a massive number of available resources and demands, and its goal is sharing the resources as services over the internet. Because of the optimal using of these services is everlasting challenge, the issue of task scheduling in CC is significant. In this paper, a task scheduling technique for CC based on SLnO and multiple-objective model are proposed. It enables decreasing in overall completion time, cost and power consumption; and maximizes the resources utilization. The simulation results on the tested data illustrated that the SLnO scheduler performed better performance than other state-of-the-art schedulers in terms of makespan, cost, energy consumption, resources utilization and degree of imbalance.FindingsThe performance of the SLnO, Vocalization of Whale Optimization Algorithm (VWOA), Whale Optimization Algorithm (WOA), Grey Wolf Optimization (GWO) and Round Robin (RR) algorithms for 100, 200, 300, 400 and 500 independent cloud tasks on 8, 16 and 32 VMs was evaluated. The results show that SLnO algorithm has better performance than VWOA, WOA, GWO and RR in terms of makespan and imbalance degree. In addition, SLnO exhausts less power than VWOA, WOA, GWO and RR. More precisely, SLnO conserves 5.6, 21.96, 22.7 and 73.98% energy compared to VWOA, WOA, GWO and RR mechanisms, respectively. On the other hand, SLnO algorithm shows better performance than the VWOA and other algorithms. The SLnO algorithm's overall execution cost of scheduling the cloud tasks is minimized by 20.62, 39.9, 42.44 and 46.9% compared with VWOA, WOA, GWO and RR algorithms, respectively. Finally, the SLnO algorithm's average resource utilization is increased by 6, 10, 11.8 and 31.8% compared with those of VWOA, WOA, GWO and RR mechanisms, respectively.Originality/valueTo the best of the authors’ knowledge, this work is original and has not been published elsewhere, nor is it currently under consideration for publication elsewhere.

Finding a suitable solution to an optimization problem designed in science is a major challenge. Therefore, these must be addressed utilizing proper approaches. Based on a random search space, optimization algorithms can find acceptable solutions to problems. Archery Algorithm (AA) is a new stochastic approach for addressing optimization problems that is discussed in this study. The fundamental idea of developing the suggested AA is to imitate the archer's shooting behavior toward the target panel. The proposed algorithm updates the location of each member of the population in each dimension of the search space by a member randomly marked by the archer. The AA is mathematically described, and its capacity to solve optimization problems is evaluated on twenty-three distinct types of objective functions. Furthermore, the proposed algorithm's performance is compared vs. eight approaches, including teaching-learning based optimization, marine predators algorithm, genetic algorithm, grey wolf optimization, particle swarm optimization, whale optimization algorithm, gravitational search algorithm, and tunicate swarm algorithm. According to the simulation findings, the AA has a good capacity to tackle optimization issues in both unimodal and multimodal scenarios, and it can give adequate quasi-optimal solutions to these problems. The analysis and comparison of competing algorithms' performance with the proposed algorithm demonstrates the superiority and competitiveness of the AA.

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.

Multi-strategy enhanced Marine Predators Algorithm with applications in engineering optimization and feature selection problems

Picking a subset of possible features is a vital step in the data-mining procedure. The decisive goal of feature-selection is to determine the optimal number of superior characteristics to make best use of the presentation of the learning algorithm. However, this problem becomes increasingly challenging to resolve as the number of features in a data set increase. Therefore, to identify the optimal feature combinations, contemporary optimization techniques are used. Numerous optimization problems have been successfully resolved using the innovative metaheuristic known as the marine predators algorithm (MPA). Support vector machines (SVMs) are a crucial technique that is expertly applied to classification issues. In this work, the issue of feature picking in large dimensional data sets is solved by adjusting the MPA using the SVM as a classifier. In order to address the problem of feature selection in large dimensional data sets, the current study suggests MPA + SVM. Ten high-dimensional data sets got from the Arizona State University (ASU) source were employed to prove the usefulness of the planned method; the outcomes are likened with those of the additional six cutting-edge picking features algorithms. We compared the following algorithms: atom search optimization (ASO), satin bowerbird optimizer (SBO), emperor penguin optimizer (EPO), equilibrium optimizer (EO), monarch butterfly optimization (MBO), and sine cosine algorithm (SCA). The consequences confirm that the planned MPA+SVM approach outperformed several metaheuristic algorithms and presented a remarkable capability to pick the utmost weighty and optimum features. MPA + SVM yields the lowermost averaged error rates, minimal classification standard deviation (STD) values, and FS rates across all data sets.

This paper presents a novel metaheuristic algorithm named as life choice-based optimizer (LCBO) developed on the typical decision-making ability of humans to attain their goals while learning from fellow members. LCBO is investigated on 29 popular benchmark functions which included six CEC-2005 functions, and its performance has been benchmarked against seven optimization techniques including recent ones. Further, different abilities of LCBO optimization algorithm such as exploitation, exploration and local minima avoidance were also investigated and have been reported. In addition to this, scalability is tested for several benchmark functions where dimensions have been varied till 200. Furthermore, two engineering optimization benchmark problems, namely pressure vessel design and cantilever beam design, were also optimized using LCBO and the results have been compared with recently reported other algorithms. The obtained comparative results in all the above-mentioned experimentations revealed the clear superiority of LCBO over the other considered metaheuristic optimization algorithms. Therefore, based on the presented investigations, it is concluded that LCBO is a potential optimizer for engineering problems.

Achieving ubiquitous coverage in 6G networks presents significant challenges due to the limitations of high-frequency signals and the need for extensive infrastructure, and providing seamless connectivity in remote and rural areas remains a challenge. We propose an integrated optimization framework for UAV-LEO-RIS-assisted wireless networks, aiming to maximize system sum rate through the strategic placement and configuration of Unmanned Aerial Vehicles (UAVs), Low Earth Orbit (LEO) satellites, and Reconfigurable Intelligent Surfaces (RIS). The framework employs a dual wireless backhaul and utilizes a grid search method for UAV placement optimization, ensuring a comprehensive evaluation of potential positions to enhance coverage and data throughput. Simulated Annealing (SA) is utilized for RIS placement optimization, effectively navigating the solution space to identify configurations that improve signal reflection and network performance. For sum rate maximization, we incorporate several metaheuristic algorithms, including Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Grey Wolf Optimization (GWO), Salp Swarm Algorithm (SSA), Marine Predators Algorithm (MPA), and a hybrid PSO-GWO approach. Simulation results demonstrate that the hybrid PSO-GWO algorithm outperforms individual metaheuristics in terms of convergence speed and achieving a higher sum rate. The coverage improves from 62% to 100%, and the results show an increase in spectrum efficiency of 23.7%.

An improved marine predators algorithm for shape optimization of developable Ball surfaces

Constrained economic dispatch following generation outage for hot spinning reserve allocation using hybrid grey wolf optimizer

Artificial neural networks (ANNs) are used to solve many problems, such as modeling, identification, prediction, and classification. The success of ANN is directly related to the training process. Meta-heuristic algorithms are used extensively for ANN training. Within the scope of this study, a feed-forward artificial neural network (FFNN) is trained using the marine predators algorithm (MPA), one of the current meta-heuristic algorithms. Namely, this study is aimed to evaluate the performance of MPA in ANN training in detail. Identification/modeling of nonlinear systems is chosen as the problem. Six nonlinear systems are used in the applications. Some of them are static, and some are dynamic. Mean squared error (MSE) is utilized as the error metric. Effective training and testing results were obtained using MPA. The best mean error values obtained for six nonlinear systems are 2.3 × 10−4, 1.8 × 10−3, 1.0 × 10−4, 1.0 × 10−4, 1.2 × 10−5, and 2.5 × 10−4. The performance of MPA is compared with 16 meta-heuristic algorithms. The results have shown that the performance of MPA is better than other algorithms in ANN training for the identification of nonlinear systems.

The increasing complexity of constrained engineering design problems has intensified the demand for metaheuristic optimization algorithms that are both computationally efficient and robust against premature convergence and search stagnation. This paper presents the Signal Lock Optimization Algorithm (SLOA), a novel population-based metaheuristic founded on the dual mechanisms of confidence reinforcement and noise suppression. The core principle of SLOA lies in identifying high-confidence solution components-referred to as signal locks-and reinforcing them during the search process while dynamically filtering stochastic perturbations that may mislead exploration in multimodal and highly constrained landscapes. The proposed algorithm incorporates adaptive parameter updating and an effective constraint-handling strategy to maintain a balanced exploration–exploitation trade-off. SLOA is extensively evaluated on a suite of widely adopted engineering benchmark problems, including Welded Beam Design, Pressure Vessel Design, Tension/Compression Spring Design, and Car Side-Impact Design. Comparative experimental results and statistical analyses demonstrate that SLOA consistently achieves superior or highly competitive solution quality, faster convergence rates, and high feasibility compared to several state-of-the-art metaheuristic algorithms. The findings confirm that the signal lock mechanism provides a reliable and scalable optimization framework for solving complex real-world engineering design problems.