Search

This paper proposes a novel nature-inspired meta-heuristic algorithm, named Snow Geese Algorithm. It is inspired by the migratory behavior of snow geese and emulates the distinctive "Herringbone" and "Straight Line" shaped flight patterns observed during their migration. The algorithm is structured into three main phases for benchmark testing. In the first phase, the Snow Geese Algorithm's numerical results are compared with those of several classical meta-heuristic algorithms using the same test functions and original data from these algorithms. In the second phase, in order to minimize potential variations during the comparison, all algorithms undergo evaluation on a standardized testing platform. In the third phase, this paper applies the Snow Geese Algorithm to solve four widely recognized engineering optimization problems: the tubular column design, piston lever optimization design, reinforced concrete beam design and car side impact design. These real-world engineering problems serve as test cases to assess Snow Geese Algorithm problem-solving capabilities. The primary objective of the Snow Geese Algorithm is to provide an alternative perspective for tackling complex optimization problems. Please note that the complete source code for the Snow Geese Algorithm is publicly available at https://github.com/stones3421/SGA-project. • Snow Geese Algorithm: A novel meta-heuristic approach inspired by snow geese flight behavior, tackling optimization problems. • Two-stage Strategy: Mimics snow geese exploration and exploitation patterns, setting it apart from traditional methods. • Performance Evaluation: Multiple algorithms are assessed on different problems. • Algorithm Features: Experimental results validate the effectiveness of the Snow Geese Algorithm. • Practical Applications: Snow Geese Algorithm shows potential in engineering optimization, aiding accurate decision-making. [ABSTRACT FROM AUTHOR]

The growing use of hydrogen as an energy carrier in the context of a renewed energy landscape is showing very promising potential. Most notably, polymer electrolyte membrane fuel cells (PEMFCs) are at the heart of the energy revolution and provide an efficient alternative to fossil fuels. The need for accurate modeling to analyze and develop the performance of PEMFCs has prompted many researchers to make major efforts in this area. This paper proposes a new approach based on an enhanced version of the bio-inspired metaheuristic salp swarm algorithm (ESSA) to identify the unknown parameters of the PEMFC model. This innovative approach was implemented by the combination of the merits of four approaches, namely the opposition-based learning, the new category of salps, referred to as exploration salps, the crossover and mutation operators, and the survival of the fittest mechanism. The newly introduced mechanisms succeed to overcome the problem of low population diversity of the SSA algorithm, accelerate its speed of convergence, strengthen the salp exploration capabilities, and improve its convergence accuracy. The performance of this technique has been tested and validated experimentally on the voltage–current characteristic on two commercial PEMFC stacks, such as 250 W and BCS500 W. The found results are compared to those of the original SSA and six recently published competitive metaheuristic algorithms simulated in various conditions as well as nine other well-cited methods from the literature. The performance comparison involved the calculation of the sum of squared errors (SSE), Standard Deviation (STD), computational speed, and statistical measurements. In this context, the best SSE and STD values obtained for Case I range 2 were 0.60132 and 1.0597 E − 14 , while those of Case II were 0.01167 and 1.1127E−15, respectively. Based on the results, the ESSA-based approach demonstrates superior performance in determining PEMFC parameters from experimental measurements, offering enhanced stability, faster convergence speed, and greater accuracy. This method thus emerges as a highly promising avenue for PEMFC parameter estimation, providing a valuable tool for optimizing fuel cell performance and design. • Modeling and parameter extraction methods for PEMFC models are investigated. • A new ESSA is proposed to tackle the parameterization problem of PEMFC. • ESSA uses OBL, exploration salps, crossover and mutation operators, and survival of the fittest mechanism. • Experimental tests show ESSA's best accuracy, convergence speed, and stability for 250 W and BCS500 W PEMFC. • ESSA is useful to develop precise simulators, and master PEMFC design and control. [ABSTRACT FROM AUTHOR]

This paper proposes the Love Evolution Algorithm (LEA), a novel evolutionary algorithm inspired by the stimulus–value–role theory. The optimization process of the LEA includes three phases: stimulus, value, and role. Both partners evolve through these phases and benefit from them regardless of the outcome of the relationship. This inspiration is abstracted into mathematical models for global optimization. The efficiency of the LEA is validated through numerical experiments with CEC2017 benchmark functions, outperforming seven metaheuristic algorithms as evidenced by the Wilcoxon signed-rank test and the Friedman test. Further tests using the CEC2022 benchmark functions confirm the competitiveness of the LEA compared to seven state-of-the-art metaheuristics. Lastly, the study extends to real-world problems, demonstrating the performance of the LEA across eight diverse engineering problems. Source codes of the LEA are publicly available at https://ww2.mathworks.cn/matlabcentral/fileexchange/159101-love-evolution-algorithm. [ABSTRACT FROM AUTHOR]

Due to using nature-inspired metaheuristic algorithms to solve real-world applications in different fields, this area has become very popular among researchers because of the flexibility of using optimization algorithms. Therefore, these algorithms can be measured based on their operator, diversity of populations, and balancing between the exploration and exploitation phases. The Grey Wolf Optimization algorithm is one of the competitive metaheuristic algorithms that was proposed in 2014. It mimics the hunting mechanism of wolves. It uses three types of wolves: alpha, beta, and delta for searching in the search space. Despite having competitive performance, GWO has problems regarding local optima and has low exploration. Therefore, enhancement GWO (EGWO) is proposed in this paper in order to solve these problems. EGWO used different methods to improve the performance of GWO: using gamma, z-position, and golden ratio. MGWO is evaluated using CEC2019 ten benchmark functions. Statistical results proved that EGWO outperforms well in six functions out of ten compared to GWO, fitness-dependent optimizer (FDO), cat swarm optimizer, and FOX optimizer. It is also used to solve two real-world applications such as pressure vessel design and 10-bar truss design problems. Results showed that EGWO is very competitive against GWO, FDO, and FOX. [ABSTRACT FROM AUTHOR]

In numerous scientific disciplines and practical applications, addressing optimization challenges is a common imperative. Nature-inspired optimization algorithms represent a highly valuable and pragmatic approach to tackling these complexities. This paper introduces Dendritic Growth Optimization (DGO), a novel algorithm inspired by natural branching patterns. DGO offers a novel solution for intricate optimization problems and demonstrates its efficiency in exploring diverse solution spaces. The algorithm has been extensively tested with a suite of machine learning algorithms, deep learning algorithms, and metaheuristic algorithms, and the results, both before and after optimization, unequivocally support the proposed algorithm's feasibility, effectiveness, and generalizability. Through empirical validation using established datasets like diabetes and breast cancer, the algorithm consistently enhances model performance across various domains. Beyond its working and experimental analysis, DGO's wide-ranging applications in machine learning, logistics, and engineering for solving real-world problems have been highlighted. The study also considers the challenges and practical implications of implementing DGO in multiple scenarios. As optimization remains crucial in research and industry, DGO emerges as a promising avenue for innovation and problem solving. [ABSTRACT FROM AUTHOR]

This paper delves into the intersection between discrete dynamical systems and bio-inspired metaheuristic algorithms. Chaos, an inherent phenomenon manifested by both continuous and discrete dynamic nonlinear systems has become an essential component of engineering design. This study examines the relationship between chaos and bio-inspired metaheuristic algorithms from two distinct angles: the presence of chaos within the realm of algorithms, and the application of bio-inspired algorithms for the identification, control, or synthesis of complex systems. Furthermore, this paper offers an in-depth exploration of the interplay between metaheuristics and complex nonlinear dynamics, including potential avenues for future research. The presented simulation studies, along with the design of objective functions for optimization and the implementation of metaheuristics, serve as a valuable foundation for subsequent experiments involving discrete nonlinear systems and complex systems with time delays. Such systems may benefit from multiparametric or multicriteria optimization approaches, paving the way for novel advancements in the field. [ABSTRACT FROM AUTHOR]

Cuckoo Search Algorithm (CSA) is a nature-inspired metaheuristic optimization algorithm. The optimization algorithm was inspired by the life story of a family of birds called the Cuckoo. In this paper, an application of the CSA, is implemented to estimate model parameters of deep-seated faults by using gravity anomalies. To increase the efficiency of the algorithm, parameter tuning studies are carried out for the optimum algorithm-based control parameters. In addition, the reliability and possible uncertainties of the obtained solutions were examined using probability density function analysis. The model parameters (z1, z2, α, x0 and ρ) for noisy and noise-free synthetic models were obtained by using CSA. These obtained parameters are very compatible with the true model parameters for noise-free data, similarly well-nigh compatible results for noisy data. As a result we can say that the method works successfully when applied to synthetic data. The technique is tested on three widely studied benchmark field data including gravity anomaly [Garber Fault (USA), Gazal Fault (Egypt), Mersa Matruh Fault (Egypt)]. In previous studies, various solution techniques have been used for the inversion of these field data and the compatibility of the model parameters obtained in this study with the values obtained from previous studies was compared. The results demonstrate that the CSA is a very effective and robust approach for the optimization of gravity anomalies. [ABSTRACT FROM AUTHOR]

In this paper, a new bio-inspired metaheuristic algorithm called Giant Armadillo Optimization (GAO) is introduced, which imitates the natural behavior of giant armadillo in the wild. The fundamental inspiration in the design of GAO is derived from the hunting strategy of giant armadillos in moving towards prey positions and digging termite mounds. The theory of GAO is expressed and mathematically modeled in two phases: (i) exploration based on simulating the movement of giant armadillos towards termite mounds, and (ii) exploitation based on simulating giant armadillos' digging skills in order to prey on and rip open termite mounds. The performance of GAO in handling optimization tasks is evaluated in order to solve the CEC 2017 test suite for problem dimensions equal to 10, 30, 50, and 100. The optimization results show that GAO is able to achieve effective solutions for optimization problems by benefiting from its high abilities in exploration, exploitation, and balancing them during the search process. The quality of the results obtained from GAO is compared with the performance of twelve well-known metaheuristic algorithms. The simulation results show that GAO presents superior performance compared to competitor algorithms by providing better results for most of the benchmark functions. The statistical analysis of the Wilcoxon rank sum test confirms that GAO has a significant statistical superiority over competitor algorithms. The implementation of GAO on the CEC 2011 test suite and four engineering design problems show that the proposed approach has effective performance in dealing with real-world applications. [ABSTRACT FROM AUTHOR]

Breast cancer is considered one of the significant health challenges and ranks among the most prevalent and dangerous cancer types affecting women globally. Early breast cancer detection and diagnosis are crucial for effective treatment and personalized therapy. Early detection and diagnosis can help patients and physicians discover new treatment options, provide a more suitable quality of life, and ensure increased survival rates. Breast cancer detection using gene expression involves many complexities, such as the issue of dimensionality and the complicatedness of the gene expression data. This paper proposes a bio-inspired CNN model for breast cancer detection using gene expression data downloaded from the cancer genome atlas (TCGA). The data contains 1208 clinical samples of 19,948 genes with 113 normal and 1095 cancerous samples. In the proposed model, Array-Array Intensity Correlation (AAIC) is used at the pre-processing stage for outlier removal, followed by a normalization process to avoid biases in the expression measures. Filtration is used for gene reduction using a threshold value of 0.25. Thereafter the pre-processed gene expression dataset was converted into images which were later converted to grayscale to meet the requirements of the model. The model also uses a hybrid model of CNN architecture with a metaheuristic algorithm, namely the Ebola Optimization Search Algorithm (EOSA), to enhance the detection of breast cancer. The traditional CNN and five hybrid algorithms were compared with the classification result of the proposed model. The competing hybrid algorithms include the Whale Optimization Algorithm (WOA-CNN), the Genetic Algorithm (GA-CNN), the Satin Bowerbird Optimization (SBO-CNN), the Life Choice-Based Optimization (LCBO-CNN), and the Multi-Verse Optimizer (MVO-CNN). The results show that the proposed model determined the classes with high-performance measurements with an accuracy of 98.3%, a precision of 99%, a recall of 99%, an f1-score of 99%, a kappa of 90.3%, a specificity of 92.8%, and a sensitivity of 98.9% for the cancerous class. The results suggest that the proposed method has the potential to be a reliable and precise approach to breast cancer detection, which is crucial for early diagnosis and personalized therapy. [ABSTRACT FROM AUTHOR]

Calibration is the backbone of any sensor and measurement philosophy. The conventional calibration techniques for electrical parameter measurement using nonlinear sensors are affected by the repeating analogue signals and lead to errors in measurement. This research paper investigates different regression‐based mathematical models to calibrate the Hall sensor for measuring RMS and the fundamental frequency. The novelty of this research work lies in the feature‐based input modelling to measure RMS current and frequency with an error of 3.37e‐12% and 7.61e‐9%, respectively. The conventional Fourier transform method is compared with six different bio‐inspired metaheuristic algorithms to estimate the frequency components of the analogue signal received from the measurement setup. Apart from the conventional sine waveforms, this paper investigates sawtooth and square waveforms as the periodic signals for determining the frequency components. The results from the comparison study show that the Whale Optimization Algorithm exhibits 1.25% lesser error whilst predicting the features in measured frequency components. Apart from this, the paper identifies a unique combination of features that effectively measures the instantaneous electrical parameter with RMSE, NRMSE, and R2 value of 158.8, 0.51, and 0.44, respectively. Experimentally it is found that the decision tree and random forest regression models calibrate the Hall sensor with 93% less error than their linear and polynomial counterparts. [ABSTRACT FROM AUTHOR]

In this paper, a new bio-inspired metaheuristic algorithm named the Kookaburra Optimization Algorithm (KOA) is introduced, which imitates the natural behavior of kookaburras in nature. The fundamental inspiration of KOA is the strategy of kookaburras when hunting and killing prey. The KOA theory is stated, and its mathematical modeling is presented in the following two phases: (i) exploration based on the simulation of prey hunting and (ii) exploitation based on the simulation of kookaburras' behavior in ensuring that their prey is killed. The performance of KOA has been evaluated on 29 standard benchmark functions from the CEC 2017 test suite for the different problem dimensions of 10, 30, 50, and 100. The optimization results show that the proposed KOA approach, by establishing a balance between exploration and exploitation, has good efficiency in managing the effective search process and providing suitable solutions for optimization problems. The results obtained using KOA have been compared with the performance of 12 well-known metaheuristic algorithms. The analysis of the simulation results shows that KOA, by providing better results in most of the benchmark functions, has provided superior performance in competition with the compared algorithms. In addition, the implementation of KOA on 22 constrained optimization problems from the CEC 2011 test suite, as well as 4 engineering design problems, shows that the proposed approach has acceptable and superior performance compared to competitor algorithms in handling real-world applications. [ABSTRACT FROM AUTHOR]

Breast cancer is considered one of the significant health challenges and ranks among the most prevalent and dangerous cancer types affecting women globally. Early breast cancer detection and diagnosis are crucial for effective treatment and personalized therapy. Early detection and diagnosis can help patients and physicians discover new treatment options, provide a more suitable quality of life, and ensure increased survival rates. Breast cancer detection using gene expression involves many complexities, such as the issue of dimensionality and the complicatedness of the gene expression data. This paper proposes a bio-inspired CNN model for breast cancer detection using gene expression data downloaded from the cancer genome atlas (TCGA). The data contains 1208 clinical samples of 19,948 genes with 113 normal and 1095 cancerous samples. In the proposed model, Array-Array Intensity Correlation (AAIC) is used at the pre-processing stage for outlier removal, followed by a normalization process to avoid biases in the expression measures. Filtration is used for gene reduction using a threshold value of 0.25. Thereafter the pre-processed gene expression dataset was converted into images which were later converted to grayscale to meet the requirements of the model. The model also uses a hybrid model of CNN architecture with a metaheuristic algorithm, namely the Ebola Optimization Search Algorithm (EOSA), to enhance the detection of breast cancer. The traditional CNN and five hybrid algorithms were compared with the classification result of the proposed model. The competing hybrid algorithms include the Whale Optimization Algorithm (WOA-CNN), the Genetic Algorithm (GA-CNN), the Satin Bowerbird Optimization (SBO-CNN), the Life Choice-Based Optimization (LCBO-CNN), and the Multi-Verse Optimizer (MVO-CNN). The results show that the proposed model determined the classes with high-performance measurements with an accuracy of 98.3%, a precision of 99%, a recall of 99%, an f1-score of 99%, a kappa of 90.3%, a specificity of 92.8%, and a sensitivity of 98.9% for the cancerous class. The results suggest that the proposed method has the potential to be a reliable and precise approach to breast cancer detection, which is crucial for early diagnosis and personalized therapy. [ABSTRACT FROM AUTHOR]

To cope with increasingly complex models of engineering design problems and to obtain more accurate design solutions, this paper proposed an improved population-based, bio-inspired optimization algorithm, called the pity beetle algorithm based on pheromone dispersion model (PBA-PDM). PBA-PDM enables a local and global search for optimization problems through the pheromone release mechanisms in female beetles and the interaction relationship between male beetles. The experimental results compared with other state-of-the-art metaheuristic optimization algorithms show that PBA-PDM has an ideal performance when dealing with both classical test functions and CEC2017 benchmark test functions. Then, the PBA-PDM is applied in dealing with real-world constrained engineering design problems to verify the effectiveness and applicability. The above experimental results show that the PBA-PDM proposed in this paper is an effective and efficient algorithm for solving real-world optimization problems. [ABSTRACT FROM AUTHOR]

In classical power systems, frequency measurements are transferred via a specialised communication channel, resulting in time delay. The time delay plays a major role in a power system, which can reduce the dynamic performance of the load–frequency control (LFC) system and can destabilise the system. The research to date has tended to focus on developing a new algorithm to determine the delay margin (DM) rather than looking into a hybrid algorithm which includes a nature-inspired metaheuristic optimisation technique. This paper introduces a novel method for computing the DM based on grey wolf optimisation (GWO), specifically for the constant time delay. In the proposed method, GWO is employed to optimise the minimum error of the spectral radius and to determine the best design variable of the crossing frequency. With the help of the proposed method, the sweeping range is no longer required, which improves the accuracy of the result. To evaluate the proposed method, a two-area network power system is considered as a case study. Furthermore, the effect of the PI controller gains on the DM is taken into account. The proposed method efficacy is demonstrated by comparing it with the most recently published methods. The results demonstrate that the proposed method is remarkably better than the existing methods found in the literature, where the smallest percentage inaccuracy using the simulation-based DM based on GWO is found to be 0.000%. [ABSTRACT FROM AUTHOR]

The optimization problems are becoming more complicated, requiring new and efficient optimization techniques to solve them. Many bio-inspired meta-heuristic algorithms have emerged in the last decade to solve these complex problems as most of these algorithms may be trapped into local optima and could not effectively solve all types of optimization problems. Hence, researchers are still trying to develop new and better optimization algorithms. This paper introduces a novel biologically-based optimization algorithm called circulatory system-based optimization (CSBO). CSBO is modeled based on the function of the body's blood vessels with two distinctive circuits, i.e. pulmonary and systemic circuits. The proposed CSBO algorithm is tested on a wide variety of complex functions of the real world and validated with the standard meta-heuristic algorithms. The results indicate that the CSBO algorithm successfully achieves the optimal solutions and avoids local optima. Note that the source code of the CSBO algorithm is publicly available at . [ABSTRACT FROM AUTHOR]

The complexity of engineering optimization problems is increasing. Classical gradient-based optimization algorithms are a mathematical means of solving complex problems whose ability to do so is limited. Metaheuristics have become more popular than exact methods for solving optimization problems because of their simplicity and the robustness of the results that they yield. Recently, population-based bio-inspired algorithms have been demonstrated to perform favorably in solving a wide range of optimization problems. The jellyfish search optimizer (JSO) is one such bio-inspired metaheuristic algorithm, which is based on the food-finding behavior of jellyfish in the ocean. According to the literature, JSO outperforms many well-known meta-heuristics in a wide range of benchmark functions and real-world applications. JSO can also be used in conjunction with other artificial intelligence-related techniques. The success of JSO in solving diverse optimization problems motivates the present comprehensive discussion of the latest findings related to JSO. This paper reviews various issues associated with JSO, such as its inspiration, variants, and applications, and will provide the latest developments and research findings concerning JSO. The systematic review contributes to the development of modified versions and the hybridization of JSO to improve upon the original JSO and present variants, and will help researchers to develop superior metaheuristic optimization algorithms with recommendations of add-on intelligent agents. [ABSTRACT FROM AUTHOR]

The biologically inspired metaheuristic algorithm obtains the optimal solution by simulating the living habits or behavior characteristics of creatures in nature. It has been widely used in many fields. A new bio-inspired algorithm, Aphids Optimization Algorithm (AOA), is proposed in this paper. This algorithm simulates the foraging process of aphids with wings, including the generation of winged aphids, flight mood, and attack mood. Concurrently, the corresponding optimization models are presented according to the above phases. At the phase of the flight mood, according to the comprehensive influence of energy and the airflow, the individuals adaptively choose the flight mode to migrate; at the phase of attack mood, individuals use their sense of smell and vision to locate food sources for movement. Experiments on benchmark test functions and two classical engineering design problems, indicate that the desired AOA is more efficient than other metaheuristic algorithms. [ABSTRACT FROM AUTHOR]

The Internet of Things is widely used, which results in the collection of enormous amounts of data with numerous redundant, irrelevant, and noisy features. In addition, many of these features need to be managed. Consequently, developing an effective feature selection (FS) strategy becomes a difficult goal. Many FS techniques, based on bioinspired metaheuristic methods, have been developed to tackle this problem. However, these methods still suffer from limitations; so, in this paper, we developed an alternative FS technique, based on integrating operators of the chameleon swarm algorithm (Cham) with the quantum-based optimization (QBO) technique. With the use of eighteen datasets from various real-world applications, we proposed that QCham is investigated and compared to well-known FS methods. The comparisons demonstrate the benefits of including a QBO operator in the Cham because the proposed QCham can efficiently and accurately detect the most crucial features. Whereas the QCham achieves nearly 92.6%, with CPU time(s) nearly 1.7 overall the tested datasets. This indicates the advantages of QCham among comparative algorithms and high efficiency of integrating the QBO with the operators of Cham algorithm that used to enhance the process of balancing between exploration and exploitation. [ABSTRACT FROM AUTHOR]

In this paper, an algorithm for the maximum extraction of energy generated by photovoltaic (PV) systems was presented. The tracking of the global maximum point of the system is complex due to the non-linearity of the current-voltage (I-V) characteristic curve of the photovoltaic modules, as they vary according to the temperature and solar irradiation in the module. To obtain the best energy efficiency in these systems, it is important that the generation is delivering the maximum power available through the arrangement. In order to solve such problems, in this work an efficient MPPT-FA method was proposed, which showed good traceability when compared to traditional methods. Most traditional MPPT techniques are not able to find the global maximum point to extract the maximum power provided by the PV system. Finally, the Firefly Metaheuristic MPPT method proved to be robust against several partial shading scenarios. Simulations were presented to demonstrate the effectiveness of the proposal when compared to the traditional MPPT-PO method. [ABSTRACT FROM AUTHOR]

This paper proposes a cost-minimization scheduling algorithm for the joint optimization of task offloading and resource allocation for workflow applications in a mobile edge computing (MEC)-supported cyber–physical system. We model this scheduling problem as an integer program that minimizes the total communication and computation cost under resources and deadline constraints upon workflow applications. To cope with this complicated optimization problem, we develop an efficient heuristic method to dispatch the workflow tasks onto MEC servers with sufficient resources. By using the task dispatching heuristic to evaluate the quality of each candidate solution, we construct a novel gene-inspired metaheuristic algorithm (GIMA) that incorporates an offspring-production operator and a conditional insertion scheme into the improvement strategy to explore high-quality solutions. Specifically, the offspring-production operator can enhance the scheduling quality by generating improved offspring solutions based on existing solutions. The conditional insertion scheme is further incorporated to reduce the computational overhead involved in solution exploration. We perform extensive simulations to justify the performance of the proposed GIMA in solving the scheduling problem studied in this work. Experimental results on real-world and synthetic workflow applications show that GIMA outperforms other metaheuristics in terms of cost reduction and computational efficiency. [ABSTRACT FROM AUTHOR]

In the present paper, a physics-inspired metaheuristic algorithm is presented to solve multi-objective optimization problems. The algorithm is developed based on the concept of Newtonian cooling law that recently has been employed by the thermal exchange optimization (TEO) algorithm to solve single-objective optimization problems efficiently. The performance of the multi-objective version of TEO (MOTEO) is examined through bi- and tri-objective mathematical and engineering problems as well as bi-objective structural design examples. According to the comparisons between the MOTEO and several well-known algorithms, the proposed algorithm can provide quality Pareto fronts with appropriate accuracy, uniformity, and coverage for multi-objective problems. [ABSTRACT FROM AUTHOR]

Salp swarm algorithm (SSA) is a relatively new bio‐inspired meta‐heuristic optimization algorithm that mimics the navigating and foraging behavior of salps in oceans. This paper presents an orthogonal quasi‐opposition‐based learning‐driven dynamic SSA (OBDSSA) for solving global optimization problems. The proposed methodology integrates orthogonal quasi‐opposition‐based learning (OQOBL) tactic and dynamic learning (DL) strategy with SSA to improve its performance. The OQOBL technique is used to enrich the exploration and development capability of the canonical SSA to help the salp chain jump out of local optimum, while the DL mechanism is applied to the basic approach to expand the neighborhood searching capabilities of the search agents. To investigate the proposed operators and OBDSSA algorithm, 18 widely used benchmark functions and parameter extraction problem of photovoltaic (PV) model have been experimented upon. The comparisons reveal that OBDSSA outperforms all competitors, including the standard SSA, SSA variants, and other state‐of‐the‐art algorithms. Finally, the developed approach is applied to path planning and obstacle avoidance (PPOA) tasks in autonomous mobile robots (AMR) and satisfactory results are obtained. [ABSTRACT FROM AUTHOR]

Motivated by the hunting strategies of cheetahs, this paper proposes a nature-inspired algorithm called the cheetah optimizer (CO). Cheetahs generally utilize three main strategies for hunting prey, i.e., searching, sitting-and-waiting, and attacking. These strategies are adopted in this work. Additionally, the leave the pray and go back home strategy is also incorporated in the hunting process to improve the proposed framework's population diversification, convergence performance, and robustness. We perform intensive testing over 14 shifted-rotated CEC-2005 benchmark functions to evaluate the performance of the proposed CO in comparison to state-of-the-art algorithms. Moreover, to test the power of the proposed CO algorithm over large-scale optimization problems, the CEC2010 and the CEC2013 benchmarks are considered. The proposed algorithm is also tested in solving one of the well-known and complex engineering problems, i.e., the economic load dispatch problem. For all considered problems, the results are shown to outperform those obtained using other conventional and improved algorithms. The simulation results demonstrate that the CO algorithm can successfully solve large-scale and challenging optimization problems and offers a significant advantage over different standards and improved and hybrid existing algorithms. Note that the source code of the CO algorithm is publicly available at https://www.optim-app.com/projects/co. [ABSTRACT FROM AUTHOR]

This paper proposes a new Multi-Objective Mantis Search Algorithm (MOMSA) to handle complex optimization problems, including real-world engineering optimization problems. The Mantis Search Algorithm (MSA) is a recently reported nature-inspired metaheuristic algorithm, and it has been inspired by the unique hunting behavior and sexual cannibalism of praying mantises. The proposed MOMSA algorithm employs the same underlying MSA mechanisms for convergence combined with an elitist non-dominated sorting approach to estimate Pareto-optimal solutions. In addition, MOMSA employs the crowding distance mechanism to enhance the coverage of optimal solutions across all objectives. To validate its performance, we conduct 29 case studies, encompassing twenty multi-objective benchmark problems (ZDT, DTLZ, and CEC 2009) and nine engineering design problems. Furthermore, MOMSA is applied to the IEEE-30 bus system, addressing both single- and multi-objective optimal power flow problems across eight distinct cases. Results are compared with some state-of-the-art approaches using various performance metrics such as GD, MS, IGD, and HV. The findings demonstrate MOMSA's ability to effectively balance convergence, diversity, and uniformity, providing valuable insights for decision-makers addressing complex problems. The source code of MOMSA is publicly accessible at https://www.mathworks.com/matlabcentral/fileexchange/159623-momsa-multi-objective-mantis-search-algorithm. • MOMSA: A Novel Multi-Objective Optimization Algorithm. • Enhancing Engineering Design through MOMSA. • Pareto-Optimal Front Maintenance by MOMSA. • MOMSA in Complex Power System Optimization. • Comparative Analysis with Leading Methods. [ABSTRACT FROM AUTHOR]

As distribution networks operate in their majority in a radial way, this condition becomes one of the most important constraints of distribution network reconfiguration (DNR) problem. There are diverse ways to represent this in DNR, but a lack of studies that provide an analysis of its behavior is noted, specially regarding its influence in metaheuristics and bio‐inspired metaheuristics. This paper presents a discussion between two alternatives to represent this in DNR in conjunction with three new bio‐inspired metaheuristics. One is based on the formation of the incidence matrix of the system and its determinant; the other is a modified approach of a method that establishes a set of forbidden switches through the analysis of the system fundamental loops. To solve DNR, three new bio‐inspired metaheuristics are presented: monarch butterfly optimization (MBO), gray wolf optimizer (GWO), and marine predators algorithm (MPA). A comparison is performed with selective particle swarm optimization (SPSO). To test the alternatives, three systems are used (33‐, 69‐, and 84‐ bus), with results showing the influence of the radiality approach in the results of bio‐inspired metaheuristics. [ABSTRACT FROM AUTHOR]

Nowadays, optimization techniques are required in various engineering domains in order to find optimal solutions for complex problems. As a result, there is a growing tendency among scientists to enhance existing nature-inspired algorithms using various evolutionary strategies and to develop new nature-inspired optimization methods that can properly explore the feature space. The recently designed nature-inspired metaheuristic, named the Golden Jackal Optimization​ (GJO) algorithm, was inspired by the collaborative hunting actions of the golden jackal in nature to solve various challenging problems. However, like other approaches, the GJO has the limitations of poor exploitation ability, ease to get stuck in a local optimal region, and an improper balancing of exploration and exploitation. To overcome these limitations, this paper proposes a novel contribution to GJO based on a new technique, namely the fast random opposition-based learning Golden Jackal Optimization algorithm (FROBL-GJO). The FROBL technique is mainly inspired by opposition-based learning (OBL) and random opposition-based learning (ROBL) techniques to enhance the optimization precision and convergence speed of the GJO algorithm. Furthermore, two other models, such as OBL-GJO and ROBL-GJO, are also proposed for comparison purposes. To examine the proficiency of the newly proposed FROBL-GJO algorithm, it has been examined with several well-known existing meta-heuristic algorithms while solving the CEC-2005 and CEC-2019 benchmark test functions and real-life engineering problems. The experimental outcomes and statistical tests reveal the superior performance of the proposed FROBL-GJO in solving both global optimization and engineering design problems. Hence, the findings of benchmark functions and engineering problems endorse that the proposed FROBL-GJO algorithm can be considered a promising method for solving complex optimization problems. • A novel strategy namely fast random opposition-based learning (FROBL) is proposed. • The FROBL is inspired by OBL and ROBL techniques to explore the search space efficiently. • FROBL is appended to the GJO algorithm to propose the FROBL-GJO algorithm. • FROBL-GJO is employed to solve different benchmark functions, and engineering problems. • FROBL-GJO generates good results compared to OBL-GJO, ROBL-GJO and other algorithms. [ABSTRACT FROM AUTHOR]

In this paper, a new metaheuristic algorithm called the Coati Optimization Algorithm (COA) is introduced, which mimics coati behavior in nature. The fundamental idea of COA is the simulation of the two natural behaviors of coatis: (i) their behavior when attacking and hunting iguanas and (ii) their escape from predators. The implementation steps of COA are described and mathematically modeled in two phases of exploration and exploitation. COA performance is evaluated on fifty-one objective functions, including twenty-nine functions from the IEEE CEC-2017 test suite and twenty-two real-world applications from the IEEE CEC-2011 test suite. COA's results are compared to those of eleven well-known metaheuristic algorithms. The simulation results indicate that COA has an evident superiority over the compared algorithms by balancing exploration in global search and exploitation in local search, and is far more competitive. To assess the COA's effectiveness in real-world applications, the proposed approach is implemented on the IEEE CEC-2011 test functions and four practical optimization problems, which the simulation results indicate the high capability of COA in dealing with these types of optimization problems. • A new optimization algorithm called Coati Optimization Algorithm (COA) is designed to model the natural behaviors of coatis. • COA's fundamental inspirations include attacking and hunting coatis and the escape behavior of coatis when confronted by predators. • The various stages of COA are described, then mathematically modeled in two phases of exploration and exploitation. • Sixty-eight standard benchmark functions have been employed to evaluate COA performance in solving optimization problems. • The performance of the COA in presenting the optimization results is compared with eight well-known metaheuristic algorithms. [ABSTRACT FROM AUTHOR]

• A novel meta-heuristic is proposed inspired by the social life and hierarchy of wild mountain gazelles. • Gazelles' hierarchical and social life is formulated mathematically and used to develop an optimization algorithm. • The proposed algorithm is evaluated and tested using several test beds and case studies. • The results demonstrate that the proposed algorithm performs better than the comparable algorithms. The Mountain Gazelle Optimizer (MGO), a novel meta-heuristic algorithm inspired by the social life and hierarchy of wild mountain gazelles, is suggested in this paper. In this algorithm, gazelles' hierarchical and social life is formulated mathematically and used to develop an optimization algorithm. The MGO algorithm is evaluated and tested using Fifty-two standard benchmark functions and seven different engineering problems. It is compared with nine other powerful meta-heuristic algorithms to validate the result. The significant differences between the comparative algorithms are demonstrated using Wilcoxon's rank-sum and Friedman's tests. Numerous experiments have shown that the MGO performs better than the comparable algorithms on utmost benchmark functions. In addition, according to the tests performed, the MGO maintains its search capabilities and shows good performance even when increasing the dimensions of optimization problems. The source codes of the MGO algorithm are publicly available at https://www.mathworks.com/matlabcentral/fileexchange/118680-mountain-gazelle-optimizer. [ABSTRACT FROM AUTHOR]

Marine predators algorithm (MPA) is a newly developed swarm-based meta-heuristic algorithm that is inspired by the foraging strategies of marine predators: Lévy, Brownian motions and optimal encounter rate strategies, and has shown competitive performance with other state-of-the-art algorithms. Despite the effectiveness of original MPA and existing improved MPA in many real applications, the diversity of the population and the solution accuracy of MPA still deserve to be improved. To this end, an enhanced marine predators algorithm with the neighborhood-based learning strategy and the adaptive population size strategy is proposed in this paper, which is termed NMPA. Also, the superiority of the proposed NMPA is verified by being compared with the original MPA, other improved MPA and popular nature-inspired optimization algorithms on the well-known CEC 2017 and CEC 2020 test suites as well as three engineering design problems, respectively. Furthermore, the practicability of NMPA is illustrated by solving a real-world application of approximate developable surface modeling. By taking the maximization of developability degree of the developable surface as the evaluation criterion, the model for interpolating two given spatial curves to design an approximate developable surface is established. Then, the proposed NMPA is used to solve the optimization model, and the approximate developable surfaces with the maximum developability degree can be obtained. The experimental results show the superior performance of NMPA over other algorithms in terms of precision, convergence rate and solution quality. To sum up, NMPA is potentially a competitive and excellent meta-heuristic algorithm for constructing approximate developable surface and solving engineering optimization problems. • An enhanced marine predators algorithm termed NMPA is proposed. • The proposed NMPA is tested on CEC2017 and CEC2020 test suites as well as 3 engineering design problems. • The superiority and validity of NMPA is verified by comparing with multiple intelligent algorithms. • Optimization model for constructing developable surface through two given space curves is established. • The NMPA is applied to the solutions of the established optimization model. [ABSTRACT FROM AUTHOR]

• A novel method to improve the performance of population-based optimizers. • The combination lock algorithm used as a pre-processing optimization method. • The combination lock algorithm produces an elite individual. • The elite individual is inserted into the initial population of optimizers. • The new algorithm significantly improves the performance of optimizers. Nature-inspired population-based metaheuristics are promising search methods for solving optimization problems. In this paper, a novel systematic pre-processing approach, called the combination lock algorithm, for obtaining a good starting point for population-based algorithms is proposed. The proposed algorithm is tested on 32 benchmark unconstrained multidimensional optimization problems of different characteristics that are either unimodal or multimodal, continuous or non-continuous, separable or non-separable, differentiable or non-differentiable. The tests also include four engineering constrained optimization benchmark problems. The experimental results of applying the proposed algorithm for the Particle Swarm Optimization, the Ant Colony Optimization for Continuous Domain, and the Grey Wolf Optimization were compared with the results obtained from the conventional approach of initializing the starting population of population-based metaheuristic methods. The simulation results show the potential of the proposed algorithm as an efficient and reliable approach to enhance the performance of population-based optimization algorithms such that, overall, 50% and up to 100% of the tested problems "across various population size" settings, had either improved or equalled the optimal values when the proposed algorithm was applied. [ABSTRACT FROM AUTHOR]

In this paper, a new bio-inspired meta-heuristic algorithm, named artificial rabbits optimization (ARO), is proposed and tested comprehensively. The inspiration of the ARO algorithm is the survival strategies of rabbits in nature, including detour foraging and random hiding. The detour foraging strategy enforces a rabbit to eat the grass near other rabbits' nests, which can prevent its nest from being discovered by predators. The random hiding strategy enables a rabbit to randomly choose one burrow from its own burrows for hiding, which can decrease the possibility of being captured by its enemies. Besides, the energy shrink of rabbits will result in the transition from the detour foraging strategy to the random hiding strategy. This study mathematically models such survival strategies to develop a new optimizer. The effectiveness of ARO is tested by comparison with other well-known optimizers by solving a suite of 31 benchmark functions and five engineering problems. The results show that ARO generally outperforms the tested competitors for solving the benchmark functions and engineering problems. ARO is applied to the fault diagnosis of a rolling bearing, in which the back-propagation (BP) network optimized by ARO is developed. The case study results demonstrate the practicability of the ARO optimizer in solving challenging real-world problems. The source code of ARO is publicly available at https://seyedalimirjalili.com/aro and https://ww2.mathworks.cn/matlabcentral/fileexchange/110250-artificial-rabbits-optimization-aro. • A new bio-inspired artificial rabbits optimization (ARO) algorithm is proposed. • ARO is inspired by the survival strategies of rabbits in nature. • The results on 31 well-known test functions show the efficiency of ARO. • ARO yields superior results over its competitors on 5 engineering problems. • ARO is successfully applied in fault diagnosis of rolling bearing. [ABSTRACT FROM AUTHOR]

This paper presents a novel meta-heuristic algorithm so-called White Shark Optimizer (WSO) to solve optimization problems over a continuous search space. The core ideas and underpinnings of WSO are inspired by the behaviors of great white sharks, including their exceptional senses of hearing and smell while navigating and foraging. These aspects of behavior are mathematically modeled to accommodate a sufficiently adequate balance between exploration and exploitation of WSO and to assist search agents to explore and exploit each potential area of the search space in order to achieve optimization. The search agents of WSO randomly update their position in connection with best-so-far solutions, to eventually arrive at the optimal outcome. The performance of WSO was comprehensively benchmarked on a set of 29 test functions from the CEC-2017 test suite for several dimensions. WSO was further applied to solve the benchmark problems of the CEC-2011 evolutionary algorithm competition to prove its reliability and applicability to real-world problems. A thorough analysis of computational and convergence results was presented to shed light on the efficacy and stability levels of WSO. The performance score of WSO in terms of several statistical methods was compared with 9 well-established meta-heuristics based on the solutions generated. Friedman's and Holm's tests of the results showed that WSO revealed reasonable solutions, in terms of global optimality, avoidance of local minima and solution quality, compared to other existing meta-heuristics. [ABSTRACT FROM AUTHOR]

Operation of distribution networks involves a series of criteria that should be met, aiming for the correct and optimal behavior of such systems. Some of the major drawbacks found when studying these networks is the real losses related to them. To overcome this problem, distribution network reconfiguration (DNR) is an efficient tool due to the low costs involved in its implementation. The majority of studies regarding this subject treat the problem by considering networks only as three-phase balanced, modeled as single-phase grids with fixed power demand, which is far from representing the characteristics of real networks (e.g., unbalanced loads, variable power and unbalance indexes). Due to the combinatorial nature of the problem, metaheuristic techniques are powerful tools for the inclusion of such characteristics. In this sense, this paper proposes a study of DNR considering balanced and unbalanced systems with variable power demand. An analysis of the direct influence of voltage unbalance index (VUI) and current unbalance index (CUI) is carried out for unbalanced cases. To solve the DNR problem, a selective bio-inspired metaheuristic based on micro bats' behavior named the selective bat algorithm (SBAT) is used together with the EPRI-OpenDSS software (California, US, EPRI). Tests are initially conducted on balanced systems, aiming to validate the technique proposed for both demands and state their differences, and then they are conducted on unbalanced systems to study the influence of VUI and CUI in the DNR solution. [ABSTRACT FROM AUTHOR]

In the world of optimization, especially concerning metaheuristics, solving complex problems represented by applying big data and constraint instances can be difficult. This is mainly due to the difficulty of implementing efficient solutions that can solve complex optimization problems in adequate time, which do exist in different industries. Big data has demonstrated its efficiency in solving different concerns in information management. In this paper, an approach based on multiprocessing is proposed wherein clusterization and parallelism are used together to improve the search process of metaheuristics when solving large instances of complex optimization problems, incorporating collaborative elements that enhance the quality of the solution. The proposal deals with machine learning algorithms to improve the segmentation of the search space. Particularly, two different clustering methods belonging to automatic learning techniques, are implemented on bio-inspired algorithms to smartly initialize their solution population, and then organize the resolution from the beginning of the search. The results show that this approach is competitive with other techniques in solving a large set of cases of a well-known NP-hard problem without incorporating too much additional complexity into the metaheuristic algorithms. [ABSTRACT FROM AUTHOR]

This paper introduces a novel population-based bio-inspired meta-heuristic optimization algorithm, called Blood Coagulation Algorithm (BCA). BCA derives inspiration from the process of blood coagulation in the human body. The underlying concepts and ideas behind the proposed algorithm are the cooperative behavior of thrombocytes and their intelligent strategy of clot formation. These behaviors are modeled and utilized to underscore intensification and diversification in a given search space. A comparison with various state-of-the-art meta-heuristic algorithms over a test suite of 23 renowned benchmark functions reflects the efficiency of BCA. An extensive investigation is conducted to analyze the performance, convergence behavior and computational complexity of BCA. The comparative study and statistical test analysis demonstrate that BCA offers very competitive and statistically significant results compared to other eminent meta-heuristic algorithms. Experimental results also show the consistent performance of BCA in high dimensional search spaces. Furthermore, we demonstrate the applicability of BCA on real-world applications by solving several real-life engineering problems. [ABSTRACT FROM AUTHOR]