Background Due to the intermittent, nonlinear, and uncertain behavior of renewable energy sources (res) such as solar and wind, grid stability and reliability require very high forecasting and optimization skills as widely reported in the literature. Traditional optimization methods work very well in small or static systems but are suffer difficulty on large-scale, dynamic and stochastic renewable environment due to their NP-hard nature. Methods The framework introduces the concept of a Machine Learning-Assisted Hybrid Cuckoo Search (ML-HCS) that combines CS with a hybrid metaheuristic and integrates Long Short-Term Memory (LSTM) networks for forecasting based on both regression models of LSTMs and hybrid optimization algorithm

The employment of cognitive radio (CR) is critical to the successful development of wireless communications. In this field, especially when using the multiple input multiple output (MIMO) antenna technology, energy consumption is critical. If the principal user (PU) is present, developers can utilize the energy detecting approach to tell. The researchers employed two distinct phases to conduct their research: the intense and accurate sensing stages. After the furious sensing step was completed, the PU user was identified as having a maximum or minimal energy channel. There are two situations in which the proposed algorithm's performance is tested: channels for fading AWGN and Rayleigh. When the proposed methods' simulation results a

The main intention of this study was to investigate the development of a new optimization technique based on the differential evolution (DE) algorithm, for the purpose of linear frequency modulation radar signal de-noising. As the standard DE algorithm is a fixed length optimizer, it is not suitable for solving signal de-noising problems that call for variability. A modified crossover scheme called rand-length crossover was designed to fit the proposed variable-length DE, and the new DE algorithm is referred to as the random variable-length crossover differential evolution (rvlx-DE) algorithm. The measurement results demonstrate a highly efficient capability for target detection in terms of frequency response and peak forming that was isola

Wireless Body Area Sensor Networks (WBASNs) have garnered significant attention due to the implementation of self-automaton and modern technologies. Within the healthcare WBASN, certain sensed data hold greater significance than others in light of their critical aspect. Such vital data must be given within a specified time frame. Data loss and delay could not be tolerated in such types of systems. Intelligent algorithms are distinguished by their superior ability to interact with various data systems. Machine learning methods can analyze the gathered data and uncover previously unknown patterns and information. These approaches can also diagnose and notify critical conditions in patients under monitoring. This study implements two s

Smart cities have recently undergone a fundamental evolution that has greatly increased their potentials. In reality, recent advances in the Internet of Things (IoT) have created new opportunities by solving a number of critical issues that are allowing innovations for smart cities as well as the creation and computerization of cutting-edge services and applications for the many city partners. In order to further the development of smart cities toward compelling sharing and connection, this study will explore the information innovation in smart cities in light of the Internet of Things (IoT) and cloud computing (CC). IoT data is first collected in the context of smart cities. The data that is gathered is uniform. The Internet of Things,

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith