The naked mole-rat algorithm

An efficient multi-level thresholding method for breast thermograms analysis based on an improved BWO algorithm

Breast cancer is a prevalent disease and the second leading cause of death in women globally. Various imaging techniques, including mammography, ultrasonography, X-ray, and magnetic resonance, are employed for detection. Thermography shows significant promise for early breast disease detection, offering advantages such as being non-ionizing, non-invasive, cost-effective, and providing real-time results. Medical image segmentation is crucial in image analysis, and this study introduces a thermographic image segmentation algorithm using the improved Black Widow Optimization Algorithm (IBWOA). While the standard BWOA is effective for complex optimization problems, it has issues with stagnation and balancing exploration and exploitation. The proposed method enhances exploration with Levy flights and improves exploitation with quasi-opposition-based learning. Comparing IBWOA with other algorithms like Harris Hawks Optimization (HHO), Linear Success-History based Adaptive Differential Evolution (LSHADE), and the whale optimization algorithm (WOA), sine cosine algorithm (SCA), and black widow optimization (BWO) using otsu and Kapur's entropy method. Results show IBWOA delivers superior performance in both qualitative and quantitative analyses including visual inspection and metrics such as fitness value, threshold values, peak signal-to-noise ratio (PSNR), structural similarity index measure (SSIM), and feature similarity index (FSIM). Experimental results demonstrate the outperformance of the proposed IBWOA, validating its effectiveness and superiority.

A hybrid swarm intelligence algorithm for region-based image fusion

This paper proposes a novel multi-hybrid algorithm named DHPN, using the best-known properties of dwarf mongoose algorithm (DMA), honey badger algorithm (HBA), prairie dog optimizer (PDO), cuckoo search (CS), grey wolf optimizer (GWO) and naked mole rat algorithm (NMRA). It follows an iterative division for extensive exploration and incorporates major parametric enhancements for improved exploitation operation. To counter the local optima problems, a stagnation phase using CS and GWO is added. Six new inertia weight operators have been analyzed to adapt algorithmic parameters, and the best combination of these parameters has been found. An analysis of the suitability of DHPN towards population variations and higher dimensions has been performed. For performance evaluation, the CEC 2005 and CEC 2019 benchmark data sets have been used. A comparison has been performed with differential evolution with active archive (JADE), self-adaptive DE (SaDE), success history based DE (SHADE), LSHADE-SPACMA, extended GWO (GWO-E), jDE100, and others. The DHPN algorithm is also used to solve the image fusion problem for four fusion quality metrics, namely, edge-based similarity index ( Q A B / F ), sum of correlation difference (SCD), structural similarity index measure (SSIM), and artifact measure ( N A B / F ). The averageQ A B / F = 0.765508 , S C D = 1.63185 , S S I M = 0.726317 , andN A B / F = 0.006617 shows the best combination of results obtained by DHPN with respect to the existing algorithms such as DCH, CBF, GTF, JSR and others. Experimental and statistical Wilcoxon's and Friedman's tests show that the proposed DHPN algorithm performs significantly better in comparison to the other algorithms under test.

Improved Multi-Strategy Sand Cat Swarm Optimization for Solving Global Optimization

The sand cat swarm optimization algorithm (SCSO) is a novel metaheuristic algorithm that has been proposed in recent years. The algorithm optimizes the search ability of individuals by mimicking the hunting behavior of sand cat groups in nature, thereby achieving robust optimization performance. It is characterized by few control parameters and simple operation. However, due to the lack of population diversity, SCSO is less efficient in solving complex problems and is prone to fall into local optimization. To address these shortcomings and refine the algorithm's efficacy, an improved multi-strategy sand cat optimization algorithm (IMSCSO) is proposed in this paper. In IMSCSO, a roulette fitness-distance balancing strategy is used to select codes to replace random agents in the exploration phase and enhance the convergence performance of the algorithm. To bolster population diversity, a novel population perturbation strategy is introduced, aiming to facilitate the algorithm's escape from local optima. Finally, a best-worst perturbation strategy is developed. The approach not only maintains diversity throughout the optimization process but also enhances the algorithm's exploitation capabilities. To evaluate the performance of the proposed IMSCSO, we conducted experiments in the CEC 2017 test suite and compared IMSCSO with seven other algorithms. The results show that the IMSCSO proposed in this paper has better optimization performance.

A novel multi-hybrid differential evolution algorithm for optimization of frame structures

Differential evolution (DE) is a robust optimizer designed for solving complex domain research problems in the computational intelligence community. In the present work, a multi-hybrid DE (MHDE) is proposed for improving the overall working capability of the algorithm without compromising the solution quality. Adaptive parameters, enhanced mutation, enhanced crossover, reducing population, iterative division and Gaussian random sampling are some of the major characteristics of the proposed MHDE algorithm. Firstly, an iterative division for improved exploration and exploitation is used, then an adaptive proportional population size reduction mechanism is followed for reducing the computational complexity. It also incorporated Weibull distribution and Gaussian random sampling to mitigate premature convergence. The proposed framework is validated by using IEEE CEC benchmark suites (CEC 2005, CEC 2014 and CEC 2017). The algorithm is applied to four engineering design problems and for the weight minimization of three frame design problems. Experimental results are analysed and compared with recent hybrid algorithms such as laplacian biogeography based optimization, adaptive differential evolution with archive (JADE), success history based DE, self adaptive DE, LSHADE, MVMO, fractional-order calculus-based flower pollination algorithm, sine cosine crow search algorithm and others. Statistically, the Friedman and Wilcoxon rank sum tests prove that the proposed algorithm fares better than others.

A self-adaptive attraction and repulsion-based naked mole-rat algorithm for energy-efficient mobile wireless sensor networks

Naked mole-rat algorithm (NMRA) is a swarm intelligence-based algorithm that draws inspiration from the mating behaviour of mole rats (workers and breeders). This approach, which is based on the ability of breeders to reproduce with the queen, has been utilized to tackle optimization problems. The algorithm, however, suffers from local optima stagnation problem and a slower rate of convergence in order to provide gobal optimal solution. This study suggests attraction and repulsion strategy based NMRA (ARNMRA) along with self-adaptive properties to avoid trapping of solution in local optima. This strategy is utilized to create new breeder rat solutions and mating factor [Formula: see text] is made self-adaptive using simulated annealing (sa) based mutation operator. ARNMRA is evaluated on CEC 2005 numerical benchmark problems and found to be superior to other algorithms, including well-known ones like selective operation based GWO (SOGWO), opposition based laplacian equilibrium optimizer (OB-L-EO), improved whale optimization algorithm (IWOA), success-history based adaptive DE (SHADE) and original NMRA. Further, according to experimental results, the performance of ARNMRA is likewise superior to the NMRA for the CEC 2019 and CEC 2020 numerical problems. Convergence profiles and statistical tests (rank-sum test and Friedman test) are employed further to validate the experimental results. Moreover, this article extends the application of ARNMRA to address the data gathering aspect in mobile wireless sensor networks (MWSNs) with the goal of prolonging network lifetime and enhancing energy efficiency. In this MWSN-based protocol, a sensor node is elected as a cluster head based on factors like mobility, residual energy, and connection time. The protocol aims to maximize the system lifetime by efficiently collecting data from all sensors and transmitting it to the base station. The study emphasizes the significance of considering dynamic node densities and speed when designing effective data-gathering protocols for MWSNs.

End fire linear antenna array synthesis using differential evolution inspired Adaptive Naked Mole Rat Algorithm

Linear antenna arrays (LAAs) play a critical role in smart system communication applications such as the Internet of Things (IoT), mobile communication and beamforming. However, minimizing secondary lobes while maintaining a low beamwidth remains challenging. This study presents an enhanced synthesis methodology for LAAs using the Adaptive Naked Mole Rat Algorithm (ANMRA). ANMRA, inspired by mole-rat mating habits, improves exploration and exploitation capabilities for directive LAA applications. The performance of ANMRA is assessed using the CEC 2019 benchmark test functions, a widely adopted standard for statistical evaluation in optimization algorithms. The proposed methodology results are also benchmarked against state-of-the-art algorithms, including the Salp Swarm Algorithm (SSA), Cuckoo Search (CS), Artificial Hummingbird Algorithm (AHOA), Chimp Optimization Algorithm (ChOA), and Naked Mole Rat Algorithm (NMRA). The results demonstrate that ANMRA achieves superior performance among the benchmarked algorithms by successfully minimizing secondary lobes and obtaining a narrow beamwidth. The ANMRA controlled design achieves the lowest Side Lobe Level (SLL) of - 37.08 dB and the smallest beamwidth of 74.68°. The statistical assessment using the benchmark test functions further confirms the effectiveness of ANMRA. By optimizing antenna element magnitude and placement control, ANMRA enables precise primary lobe placement, grating lobe elimination, and high directivity in LAAs. This research contributes to advancing smart system communication technologies, particularly in the context of IoT and beamforming applications, by providing an enhanced synthesis methodology for LAAs that offers improved performance in terms of secondary lobe reduction and beamwidth optimization.

An exhaustive review of the metaheuristic algorithms for search and optimization: taxonomy, applications, and open challenges

As the world moves towards industrialization, optimization problems become more challenging to solve in a reasonable time. More than 500 new metaheuristic algorithms (MAs) have been developed to date, with over 350 of them appearing in the last decade. The literature has grown significantly in recent years and should be thoroughly reviewed. In this study, approximately 540 MAs are tracked, and statistical information is also provided. Due to the proliferation of MAs in recent years, the issue of substantial similarities between algorithms with different names has become widespread. This raises an essential question: can an optimization technique be called 'novel' if its search properties are modified or almost equal to existing methods? Many recent MAs are said to be based on 'novel ideas', so they are discussed. Furthermore, this study categorizes MAs based on the number of control parameters, which is a new taxonomy in the field. MAs have been extensively employed in various fields as powerful optimization tools, and some of their real-world applications are demonstrated. A few limitations and open challenges have been identified, which may lead to a new direction for MAs in the future. Although researchers have reported many excellent results in several research papers, review articles, and monographs during the last decade, many unexplored places are still waiting to be discovered. This study will assist newcomers in understanding some of the major domains of metaheuristics and their real-world applications. We anticipate this resource will also be useful to our research community.

Rainfall prediction using multiple inclusive models and large climate indices

Rainfall prediction is vital for the management of available water resources. Accordingly, this study used large lagged climate indices to predict rainfall in Iran's Sefidrood basin. A radial basis function neural network (RBFNN) and a multilayer perceptron (MLP) network were used to predict monthly rainfall. The models were trained using the naked mole rat (NMR) algorithm, firefly algorithm (FFA), genetic algorithm (GA), and particle swarm optimization (PSO) algorithm. Large lagged climate indices, as well as three hybrid models, i.e., inclusive multiple model (IMM)-MLP, IMM-RBFNN, and the simple average method (SAM), were then employed to predict rainfall. This paper aims to predict rainfall using large climate indices, ensemble models, and optimized artificial neural network models. Also, the paper considers the uncertainty resources in the modeling process. The inputs were selected using a new input selection method, namely a hybrid gamma test (GT). The GT was integrated with the NMR algorithm to create a new test for determining the best input scenario. Therefore, the main innovations of this study were the introduction of the new ensemble and the new hybrid GT, as well as the new MLP and RBFNN models. The introduced ensemble models of the current study are not only useful for rainfall prediction but also can be used to predict other metrological parameters. The uncertainty of the model parameters and input data were also analysed. It was found that the IMM-MLP model reduced the root mean square error (RMSE) of the IMM-RBFNN, SAM, MLP-NMR, RBFNN-NMR, MLP-FFA, RBFNN-FFA, MLP-PSO, RBFNN-PSO, MLP-GA, and RBFNN-GA, MLP, and RBFNN models by 12%, 25%, 31%, 55%, 60%, 62%, 66%, 69%, 70%, 71%, 72%, and 72%, respectively. The IMMs, such as the IMM-MLP, IMM-RBFNN, and SAM, outperformed standalone models. The uncertainty bound of the multiple inclusive models was narrower than that of the standalone MLP and RBFNN models. The MLP-NMR model decreased the RMSE of the RBFNN-NMR, RBFNN-FFA, RBFNN-PSO, and RBFNN models by 15%, 26%, 37%, 42%, and 45%, respectively. The proposed ensemble models were robust tools for combining standalone models to predict hydrological variables.

Wild Geese Migration Optimization Algorithm: A New Meta-Heuristic Algorithm for Solving Inverse Kinematics of Robot

This paper proposes a new meta-heuristic algorithm, named wild geese migration optimization (GMO) algorithm. It is inspired by the social behavior of wild geese swarming in nature. They maintain a special formation for long-distance migration in small groups for survival and reproduction. The mathematical model is established based on these social behaviors to solve optimization problems. Meanwhile, the performance of the GMO algorithm is tested on the stable benchmark function of CEC2017, and its potential for dealing with practical problems is studied in five engineering design problems and the inverse kinematics solution of robot. The test results show that the GMO algorithm has excellent computational performance compared to other algorithms. The practical application results show that the GMO algorithm has strong applicability, more accurate optimization results, and more competitiveness in challenging problems with unknown search space, compared with well-known algorithms in the literature. The proposal of GMO algorithm enriches the team of swarm intelligence optimization algorithms and also provides a new solution for solving engineering design problems and inverse kinematics of robots.

Improved Sparrow Algorithm Based on Game Predatory Mechanism and Suicide Mechanism

In order to overcome the defect that sparrow search algorithm converges very fast but is easy to fall into the trap of local optimization, based on the original mechanism of sparrow algorithm, this paper proposes game predatory mechanism and suicide mechanism, which makes sparrow algorithm more in line with its biological characteristics and enhances the ability of the algorithm to get rid of the attraction of local optimization while retaining the advantages of fast convergence speed. By initializing the population with the good point set strategy, the quality of the initial population is guaranteed and the diversity of the population is enhanced. In view of the current situation that the diversity index evaluation does not consider the invalid search caused by individuals beyond the boundary in the search process, an index to measure the invalid search beyond the boundary in the search process is proposed, and the measurement of diversity index is further improved to make it more accurate. The improved algorithm is tested on six basic functions and CEC2017 test function to verify its effectiveness. Finally, the improved algorithm is applied to the three-dimensional path planning of UAV with threat area. The results show that the improved algorithm has stronger optimization performance, has strong competitiveness compared with other algorithms, and can quickly plan the effective and stable path of UAV, which improves an effective method for the application in this field and other fields.

Nature-inspired optimization algorithms and their significance in multi-thresholding image segmentation: an inclusive review

Multilevel Thresholding (MLT) is considered as a significant and imperative research field in image segmentation that can efficiently resolve difficulties aroused while analyzing the segmented regions of multifaceted images with complicated nonlinear conditions. MLT being a simple exponential combinatorial optimization problem is commonly phrased by means of a sophisticated objective function requirement that can only be addressed by nondeterministic approaches. Consequently, researchers are engaging Nature-Inspired Optimization Algorithms (NIOA) as an alternate methodology that can be widely employed for resolving problems related to MLT. This paper delivers an acquainted review related to novel NIOA shaped lately in last three years (2019-2021) highlighting and exploring the major challenges encountered during the development of image multi-thresholding models based on NIOA.

Application of bio-inspired optimization algorithms in food processing

Bio-inspired optimization techniques (BOT) are part of intelligent computing techniques. There are several BOTs available and many new BOTs are evolving in this era of industrial revolution 4.0. Genetic algorithm, particle swarm optimization, artificial bee colony, and grey wolf optimization are the techniques explored by researchers in the field of food processing technology. Although, there are other potential methods that may efficiently solve the optimum related problem in food industries. In this review, the mathematical background of the techniques, their application and the potential microbial-based optimization methods with higher precision has been surveyed for a complete and comprehensive understanding of BOTs along with their mechanism of functioning. These techniques can simulate the process efficiently and able to find the near-to-optimal value expeditiously.

An Efficient Adaptive Salp Swarm Algorithm Using Type II Fuzzy Entropy for Multilevel Thresholding Image Segmentation

Salp swarm algorithm (SSA) is an innovative contribution to smart swarm algorithms and has shown its utility in a wide range of research domains. While it is an efficient algorithm, it is noted that SSA suffers from several issues, including weak exploitation, convergence, and unstable exploitation and exploration. To overcome these, an improved SSA called as adaptive salp swarm algorithm (ASSA) was proposed. Thresholding is among the most effective image segmentation methods in which the objective function is described in relation of threshold values and their position in the histogram. Only if one threshold is assumed, a segmented image of two groups is obtained. But on other side, several groups in the output image are generated with multilevel thresholds. The methods proposed by authors previously were traditional measures to identify objective functions. However, the basic challenge with thresholding methods is defining the threshold numbers that the individual must choose. In this paper, ASSA, along with type II fuzzy entropy, is proposed. The technique presented is examined in context with multilevel image thresholding, specifically with ASSA. For this reason, the proposed method is tested using various images simultaneously with histograms. For evaluating the performance efficiency of the proposed method, the results are compared, and robustness is tested with the efficiency of the proposed method to multilevel segmentation of image; numerous images are utilized arbitrarily from datasets.

A Modified Slime Mould Algorithm for Global Optimization

Slime mould algorithm (SMA) is a population-based metaheuristic algorithm inspired by the phenomenon of slime mould oscillation. The SMA is competitive compared to other algorithms but still suffers from the disadvantages of unbalanced exploitation and exploration and is easy to fall into local optima. To address these shortcomings, an improved variant of SMA named MSMA is proposed in this paper. Firstly, a chaotic opposition-based learning strategy is used to enhance population diversity. Secondly, two adaptive parameter control strategies are proposed to balance exploitation and exploration. Finally, a spiral search strategy is used to help SMA get rid of local optimum. The superiority of MSMA is verified in 13 multidimensional test functions and 10 fixed-dimensional test functions. In addition, two engineering optimization problems are used to verify the potential of MSMA to solve real-world optimization problems. The simulation results show that the proposed MSMA outperforms other comparative algorithms in terms of convergence accuracy, convergence speed, and stability.

Optimization of FFF Process Parameters by Naked Mole-Rat Algorithms with Enhanced Exploration and Exploitation Capabilities

Fused filament fabrication (FFF) has numerous process parameters that influence the mechanical strength of parts. Hence, many optimization studies are performed using conventional tools and algorithms. Although studies have also been performed using advanced algorithms, limited research has been reported in which variants of the naked mole-rat algorithm (NMRA) are implemented for solving the optimization issues of manufacturing processes. This study was performed to scrutinize optimum parameters and their levels to attain maximum impact strength, flexural strength and tensile strength based on five different FFF process parameters. The algorithm yielded better results than other studies and successfully achieved a maximum response, which may be helpful to enhance the mechanical strength of FFF parts. The study opens a plethora of research prospects for implementing NMRA in manufacturing. Moreover, the findings may help identify critical parametric levels for the fabrication of customized products at the commercial level and help to attain the objectives of Industry 4.0.

Political optimizer with interpolation strategy for global optimization

Political optimizer (PO) is a relatively state-of-the-art meta-heuristic optimization technique for global optimization problems, as well as real-world engineering optimization, which mimics the multi-staged process of politics in human society. However, due to a greedy strategy during the election phase, and an inappropriate balance of global exploration and local exploitation during the party switching stage, it suffers from stagnation in local optima with a low convergence accuracy. To overcome such drawbacks, a sequence of novel PO variants were proposed by integrating PO with Quadratic Interpolation, Advance Quadratic Interpolation, Cubic Interpolation, Lagrange Interpolation, Newton Interpolation, and Refraction Learning (RL). The main contributions of this work are listed as follows. (1) The interpolation strategy was adopted to help the current global optima jump out of local optima. (2) Specifically, RL was integrated into PO to improve the diversity of the population. (3) To improve the ability of balancing exploration and exploitation during the party switching stage, a logistic model was proposed to maintain a good balance. To the best of our knowledge, PO combined with the interpolation strategy and RL was proposed here for the first time. The performance of the best PO variant was evaluated by 19 widely used benchmark functions and 30 test functions from the IEEE CEC 2014. Experimental results revealed the superior performance of the proposed algorithm in terms of exploration capacity.

An Improved Adaptive Genetic Algorithm for Two-Dimensional Rectangular Packing Problem

This paper proposes the hybrid adaptive genetic algorithm (HAGA) as an improved method for solving the NP-hard two-dimensional rectangular packing problem to maximize the filling rate of a rectangular sheet. The packing sequence and rotation state are encoded in a two-stage approach, and the initial population is constructed from random generation by a combination of sorting rules. After using the sort-based method as an improved selection operator for the hybrid adaptive genetic algorithm, the crossover probability and mutation probability are adjusted adaptively according to the joint action of individual fitness from the local perspective and the global perspective of population evolution. The approach not only can obtain differential performance for individuals but also deals with the impact of dynamic changes on population evolution to quickly find a further improved solution. The heuristic placement algorithm decodes the rectangular packing sequence and addresses the two-dimensional rectangular packing problem through continuous iterative optimization. The computational results of a wide range of benchmark instances from zero-waste to non-zero-waste problems show that the HAGA outperforms those of two adaptive genetic algorithms from the related literature. Compared with some recent algorithms, this algorithm, which can be increased by up to 1.6604% for the average filling rate, has great significance for improving the quality of work in fields such as packing and cutting.

Time series analysis of the COVID-19 pandemic in Australia using genetic programming

COVID-19 has emerged as a global pandemic over the past four months and has impacted more than 180 countries of the world. With a global increase rate of 3% to 5% daily cases, the virus seems to be a never ending process and WHO reports that the virus may stay here forever. So it becomes necessary to analyze the possible impact of the virus globally and present predictions on how it will behave in future. In this chapter, time series forecasting of COVID-19 with respect to Australia has been analyzed, and prediction models have been derived by using genetic programming. Two prediction models have been proposed, one each for confirmed cases and death cases. The results are validated and importance of prediction variables are presented and discussed. From the numerical results, it can be said that the proposed gene expression programming models are highly reliable and can be considered as standard for time series prediction for COVID-19 in Australia.

Evolutionary modelling of the COVID-19 pandemic in fifteen most affected countries

COVID-19 or SARS-Cov-2, affecting 6 million people and more than 300,000 deaths, the global pandemic has engulfed more than 90% countries of the world. The virus started from a single organism and is escalating at a rate of 3% to 5% daily and seems to be a never ending process. Understanding the basic dynamics and presenting new predictions models for evaluating the potential effect of the virus is highly crucial. In present work, an evolutionary data analytics method called as Genetic programming (GP) is used to mathematically model the potential effect of coronavirus in 15 most affected countries of the world. Two datasets namely confirmed cases (CC) and death cases (DC) were taken into consideration to estimate, how transmission varied in these countries between January 2020 and May 2020. Further, a percentage rise in the number of daily cases is also shown till 8 June 2020 and it is expected that Brazil will have the maximum rise in CC and USA have the most DC. Also, prediction of number of new CC and DC cases for every one million people in each of these countries is presented. The proposed model predicted that the transmission of COVID-19 in China is declining since late March 2020; in Singapore, France, Italy, Germany and Spain the curve has stagnated; in case of Canada, South Africa, Iran and Turkey the number of cases are rising slowly; whereas for USA, UK, Brazil, Russia and Mexico the rate of increase is very high and control measures need to be taken to stop the chains of transmission. Apart from that, the proposed prediction models are simple mathematical equations and future predictions can be drawn from these general equations. From the experimental results and statistical validation, it can be said that the proposed models use simple linkage functions and provide highly reliable results for time series prediction of COVID-19 in these countries.

Time Series Analysis and Forecast of the COVID-19 Pandemic in India using Genetic Programming

COVID-19 declared as a global pandemic by WHO, has emerged as the most aggressive disease, impacting more than 90% countries of the world. The virus started from a single human being in China, is now increasing globally at a rate of 3% to 5% daily and has become a never ending process. Some studies even predict that the virus will stay with us forever. India being the second most populous country of the world, is also not saved, and the virus is spreading as a community level transmitter. Therefore, it become really important to analyse the possible impact of COVID-19 in India and forecast how it will behave in the days to come. In present work, prediction models based on genetic programming (GP) have been developed for confirmed cases (CC) and death cases (DC) across three most affected states namely Maharashtra, Gujarat and Delhi as well as whole India. The proposed prediction models are presented using explicit formula, and impotence of prediction variables are studied. Here, statistical parameters and metrics have been used for evaluated and validate the evolved models. From the results, it has been found that the proposed GEP-based models use simple linkage functions and are highly reliable for time series prediction of COVID-19 cases in India.