Abstract

This paper introduces a new hybrid algorithm named Transient Search Naked Mole-Rat Optimizer (TsNMRO), based on the hybridization of transient search optimizer (TSO) merged in the naked mole-rat algorithm (NMRA). To improve the worker phase of traditional NMRA, the new algorithm combines TSO’s exploratory notions with NMRA. A novel stagnation phase motivated by the grey wolf optimizer (GWO) and cuckoo search (CS) algorithms has been implemented to tackle the local optima stagnation problem. In addition, self-adaptivity has been included by adjusting all of the proposed algorithm’s parameters. For varied parameters of the algorithm under examination, a simulated annealing (sa) based mutation technique has been used, requiring no user-based parametric modifications. CEC 2005, CEC 2019 benchmark challenges, and image thresholding issues are identified to evaluate the TsNMRO’s performance. The significance of the suggested technique across higher dimensional problems and variable function evaluations has been demonstrated by a comparison of varying dimension sizes. It can be observed from the experimental outcomes that the suggested TsNMRO outperforms competitive methods in terms of mean and standard deviation values for most of the cases. The suggested TsNMRO’s improved performance is further validated by statistical results such as Freidman’s test, Wilcoxon’s rank-sum test and convergence profiles.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call