Author:
Singh Supreet,Singh Urvinder,Mittal Nitin,Gared Fikreselam
Abstract
AbstractNaked 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 $$(\lambda )$$
(
λ
)
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.
Publisher
Springer Science and Business Media LLC
Reference39 articles.
1. Coello, C. A. C. Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state of the art. Comput. Methods Appl. Mech. Eng. 191, 1245–1287 (2002).
2. Mittal, N., Singh, U., Salgotra, R. & Sohi, B. S. A Boolean spider monkey optimization based energy efficient clustering approach for WSNs. Wirel. Netw. 24, 2093–2109 (2018).
3. Holland, J. H. Genetic algorithms. Sci. Am. 267, 66–73 (1992).
4. Storn, R. Differrential Evolution—A Simple and Efficient Adaptive Scheme for Global Optimization Over Continuous Spaces, vol. 11. Technical report (International Computer Science Institute, 1995).
5. Mirjalili, S. Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm. Knowl. Based Syst. 89, 228–249 (2015).
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献