Nature-inspired Cuckoo Search Algorithm for Side Lobe Suppression in a Symmetric Linear Antenna Array

In this paper, we proposed a newly modified cuckoo search (MCS) algorithm integrated with the Roulette wheel selection operator and the inertia weight controlling the search ability towards synthesizing symmetric linear array geometry with minimum side lobe level (SLL) and/or nulls control. The basic cuckoo search (CS) algorithm is primarily based on the natural obligate brood parasitic behavior of some cuckoo species in combination with the Levy flight behavior of some birds and fruit flies. The CS metaheuristic approach is straightforward and capable of solving effectively general N-dimensional, linear and nonlinear optimization problems. The array geometry synthesis is first formulated as an optimization problem with the goal of SLL suppression and/or null prescribed placement in certain directions, and then solved by the newly MCS algorithm for the optimum element or isotropic radiator locations in the azimuth-plane or xy-plane. The study also focuses on the four internal parameters of MCS algorithm specifically on their implicit effects in the array synthesis. The optimal inter-element spacing solutions obtained by the MCS-optimizer are validated through comparisons with the standard CS-optimizer and the conventional array within the uniform and the Dolph-Chebyshev envelope patterns using MATLABTM. Finally, we also compared the fine-tuned MCS algorithm with two popular evolutionary algorithm (EA) techniques include particle swarm optimization (PSO) and genetic algorithms (GA)

Swarm dynamics may give rise to Lévy flights

“Continuous-time correlated random walks” are now gaining traction as models of scale-finite animal movement patterns because they overcome inherent shortcomings with the prevailing paradigm - discrete random walk models. Continuous-time correlated random walk models are founded on the classic Langevin equation that is driven by purely additive noise. The Langevin equation is, however, changed fundamentally by the smallest of multiplicative noises. The inclusion of such noises gives rise to Lévy flights, a popular but controversial model of scale-free movement patterns. Multiplicative noises have not featured prominently in the literature on biological Lévy flights, being seen, perhaps, as no more than a mathematical contrivance. Here we show how Langevin equations driven by multiplicative noises and incumbent Lévy flights arise naturally in the modelling of swarms. Model predictions find some support in three-dimensional, time-resolved measurements of the positions of individual insects in laboratory swarms of the midge Chironomus riparius. We hereby provide a new window on Lévy flights as models of movement pattern data, linking patterns to generative processes

Optimizing artificial neural networks using LevyChaotic mapping on Wolf Pack optimization algorithm for detect driving sleepiness

Artificial Neural Networks (ANNs) are utilized to solve a variety of problems in many domains. In this type of network, training and selecting parameters that define networks architecture play an important role in enhancing the accuracy of the network's output; Therefore, Prior to training, those parameters must be optimized. Grey Wolf Optimizer (GWO) has been considered one of the efficient developed approaches in the Swarm Intelligence area that is used to solve real-world optimization problems. However, GWO still faces a problem of the slump in local optimums in some places due to insufficient diversity. This paper proposes a novel algorithm Levy Flight- Chaotic Chen mapping on Wolf Pack Algorithm in Neural Network. It efficiently exploits the search regions to detect driving sleepiness and balance the exploration and exploitation operators, which are considered implied features of any stochastic search algorithm. Due to the lack of dataset availability, a dataset of 15 participants has been collected from scratch to evaluate the proposed algorithm's performance. The results show that the proposed algorithm achieves an accuracy of 99.3%

Adopting Scenario-Based approach to solve optimal reactive power Dispatch problem with integration of wind and solar energy using improved Marine predator algorithm

The penetration of renewable energy resources into electric power networks has been increased considerably to reduce the dependence of conventional energy resources, reducing the generation cost and greenhouse emissions. The wind and photovoltaic (PV) based systems are the most applied technologies in electrical systems compared to other technologies of renewable energy resources. However, there are some complications and challenges to incorporating these resources due to their stochastic nature, intermittency, and variability of output powers. Therefore, solving the optimal reactive power dispatch (ORPD) problem with considering the uncertainties of renewable energy resources is a challenging task. Application of the Marine Predators Algorithm (MPA) for solving complex multimodal and non-linear problems such as ORPD under system uncertainties may cause entrapment into local optima and suffer from stagnation. The aim of this paper is to solve the ORPD problem under deterministic and probabilistic states of the system using an improved marine predator algorithm (IMPA). The IMPA is based on enhancing the exploitation phase of the conventional MPA. The proposed enhancement is based on updating the locations of the populations in spiral orientation around the sorted populations in the first iteration process, while in the final stage, the locations of the populations are updated their locations in adaptive steps closed to the best population only. The scenario-based approach is utilized for uncertainties representation where a set of scenarios are generated with the combination of uncertainties the load demands and power of the renewable resources. The proposed algorithm is validated and tested on the IEEE 30-bus system as well as the captured results are compared with those outcomes from the state-of-the-art algorithms. A computational study shows the superiority of the proposed algorithm over the other reported algorithms