Search Results (50)

Financial Time Series Forecasting (TSF) remains a critical challenge in Artificial Intelligence (AI) due to the inherent complexity of financial data, characterized by strong non-linearity, dynamic non-stationarity, and multi-factor coupling. To address the performance limitations of Spiking Neural Networks (SNNs) caused by hyperparameter sensitivity, this study proposes an SNN model optimized by an Improved Cuckoo Search (ICS) algorithm (termed ICS-SNN). The ICS algorithm enhances global search capability through piecewise-mapping-based population initialization and introduces a dynamic discovery probability mechanism that adaptively increases with iteration rounds, thereby balancing exploration and exploitation. Applied to futures market price difference prediction, experimental results demonstrate that ICS-SNN achieves reductions of 13.82% in MAE, 21.27% in MSE, and 15.21% in MAPE, while improving the coefficient of determination (R²) from 0.9790 to 0.9822, compared to the baseline SNN. Furthermore, ICS-SNN significantly outperforms mainstream models such as Long Short-Term Memory (LSTM) and Backpropagation (BP) networks, reducing prediction errors by 10.8% (MAE) and 34.9% (MSE), respectively, without compromising computational efficiency. This work highlights that ICS-SNN provides a biologically plausible and computationally efficient framework for complex financial TSF, bridging the gap between neuromorphic principles and real-world financial analytics. The proposed method not only reduces manual intervention in hyperparameter tuning but also offers a scalable solution for high-frequency trading and multi-modal data fusion in future research. Full article

Photovoltaic (PV) systems are increasingly recognized as a viable renewable energy source due to their clean, abundant, silent, and environmentally friendly nature. However, their efficiency is significantly influenced by environmental conditions, necessitating advanced control strategies to ensure optimal power extraction. This study aims to enhance the performance of PV systems by developing and evaluating maximum power point tracking (MPPT) algorithms capable of operating effectively under both uniform irradiance and partial shading conditions (PSCs). Specifically, two metaheuristic algorithms—Particle Swarm Optimization (PSO) and Cuckoo Search Optimization (CSO)—are modeled, implemented, and tested for tracking the global peak power (GPP) in various static and dynamic scenarios. Simulation results indicate that both algorithms accurately and efficiently track the GPP under static uniform and PSCs. Under dynamic conditions, while both the PSO and CSO can initially locate the GPP, they fail to maintain accurate tracking during subsequent intervals. Notably, CSO exhibits reduced oscillations and faster response time compared with PSO. These findings suggest that while metaheuristic MPPT methods are effective in static environments, their performance in dynamic conditions remains a challenge requiring further enhancement. Full article

Internet of Things (IoT) technology has facilitated the deployment of autonomous sensors in remote and challenging environments, enabling substantial advancements in environmental monitoring and data collection. IoT sensors continuously gather data, transmitting it to a central Base Station (BS) via designated Cluster Heads (CHs). However, data flow encounters frequent congestion at CH nodes, negatively impacting network performance and Quality of Service (QoS). This paper introduces a novel congestion control strategy tailored for Wireless Sensor Networks (WSNs) to balance energy efficiency and data reliability. The proposed approach follows an eight-step process, integrating Generative Adversarial Networks (GANs) for enhanced clustering and Ant Colony Optimization (ACO) for optimal CH selection and routing. GANs simulate realistic node clustering, achieving better load distribution and energy conservation across the network. ACO then selects CHs based on energy levels, distance, and network centrality, using pheromone-based routing to adaptively manage data flows. A congestion factor (CF) threshold is also incorporated to dynamically reroute traffic when congestion risks arise, preserving QoS. Simulation results show that this approach significantly improves QoS metrics, including latency, throughput, and reliability. Comparative evaluations reveal that our method outperforms existing frameworks, such as Fuzzy Structure and Genetic-Fuzzy (FSFG), Deep Reinforcement Learning Cache-Aware Congestion Control (DRL-CaCC), and Adaptive Cuckoo Search Rate Optimization (ACSRO). Full article

This study evaluates and compares the computational performance and practical applicability of advanced path planning algorithms for Unmanned Aerial Vehicles (UAVs) in dynamic and obstacle-rich environments. The Adaptive Multi-Objective Path Planning (AMOPP) framework is highlighted for its ability to balance multiple objectives, including path length, smoothness, collision avoidance, and real-time responsiveness. Through experimental analysis, AMOPP demonstrates superior performance, with a 15% reduction in path length compared to A*, achieving an average path length of 450 m. Its angular deviation of 8.0° ensures smoother trajectories than traditional methods like Genetic Algorithm and Particle Swarm Optimization (PSO). Moreover, AMOPP achieves a 0% collision rate across all simulations, surpassing heuristic-based methods like Cuckoo Search and Bee Colony Optimization, which exhibit higher collision rates. Real-time responsiveness is another key strength of AMOPP, with an average re-planning time of 0.75 s, significantly outperforming A* and RRT*. The computational complexities of each algorithm are analyzed, with AMOPP exhibiting a time complexity of $O(k·n)$ and a space complexity of $O\left(n\right)$, ensuring scalability and efficiency for large-scale operations. The study also presents a comprehensive qualitative and quantitative comparison of 14 algorithms using 3D visualizations, highlighting their strengths, limitations, and suitable application scenarios. By integrating weighted optimization with penalty-based strategies and spline interpolation, AMOPP provides a robust solution for UAV path planning, particularly in scenarios requiring smooth navigation and adaptive re-planning. This work establishes AMOPP as a promising framework for real-time, efficient, and safe UAV operations in dynamic environments. Full article

Background: Alzheimer’s disease (AD) is a progressive neurological disorder that significantly affects middle-aged and elderly adults, leading to cognitive deterioration and hindering daily activities. Notwithstanding progress, conventional diagnostic techniques continue to be susceptible to inaccuracies and inefficiencies. Timely and precise diagnosis is essential for early intervention. Methods: We present an enhanced hybrid deep learning framework that amalgamates the EfficientNetV2B3 with Inception-ResNetV2 models. The models were integrated using an adaptive weight selection process informed by the Cuckoo Search optimization algorithm. The procedure commences with the pre-processing of neuroimaging data to guarantee quality and uniformity. Features are subsequently retrieved from the neuroimaging data by utilizing the EfficientNetV2B3 and Inception-ResNetV2 models. The Cuckoo Search algorithm allocates weights to various models dynamically, contingent upon their efficacy in particular diagnostic tasks. The framework achieves balanced usage of the distinct characteristics of both models through the iterative optimization of the weight configuration. This method improves classification accuracy, especially for early-stage Alzheimer’s disease. A thorough assessment was conducted on extensive neuroimaging datasets to verify the framework’s efficacy. Results: The framework attained a Scott’s Pi agreement score of 0.9907, indicating exceptional diagnostic accuracy and dependability, especially in identifying the early stages of Alzheimer’s disease. The results show its superiority over current state-of-the-art techniques.Conclusions: The results indicate the substantial potential of the proposed framework as a reliable and scalable instrument for the identification of Alzheimer’s disease. This method effectively mitigates the shortcomings of conventional diagnostic techniques and current deep learning algorithms by utilizing the complementing capabilities of EfficientNetV2B3 and Inception-ResNetV2 by using an optimized weight selection mechanism. The adaptive characteristics of the Cuckoo Search optimization facilitate its application across many diagnostic circumstances, hence extending its utility to a wider array of neuroimaging datasets. The capacity to accurately identify early-stage Alzheimer’s disease is essential for facilitating prompt therapies, which are crucial for decelerating disease development and enhancing patient outcomes. Full article

Resource Constraint Project Scheduling Problems with Discounted Cash Flows (RCPSPDC) focuses on maximizing the net present value by summing the discounted cash flows of project activities. An extension of this problem is the Payment at Event Occurrences (PEO) scheme, where the client makes multiple payments to the contractor upon completion of predefined activities, with additional final settlement at project completion. Numerous approximation methods such as metaheuristics have been proposed to solve this NP-hard problem. However, these methods suffer from parameter control and/or the computational cost of correcting infeasible solutions. Alternatively, approximate dynamic programming (ADP) sequentially generates a schedule based on strategies computed via Monte Carlo (MC) simulations. This saves the computations required for solution corrections, but its performance is highly dependent on its strategy. In this study, we propose the hybridization of ADP with three different metaheuristics to take advantage of their combined strengths, resulting in six different models. The Estimation of Distribution Algorithm (EDA) and Ant Colony Optimization (ACO) were used to recommend policies for ADP. A Discrete cCuckoo Search (DCS) further improved the schedules generated by ADP. Our experimental analysis performed on the j30, j60, and j90 datasets of PSPLIB has shown that ADP–DCS is better than ADP alone. Implementing the EDA and ACO as prioritization strategies for Monte Carlo simulations greatly improved the solutions with high statistical significance. In addition, models with the EDA showed better performance than those with ACO and random priority, especially when the number of events increased. Full article

As the power market system gradually perfects, the increasingly fierce competition not only drives industry development but also brings new challenges. Reactive power optimization is crucial for maintaining stable power grid operation and improving energy efficiency. However, the implementation of plant–grid separation policies has kept optimization costs high, affecting the profit distribution between power generation companies and grid companies. Therefore, researching how to effectively reduce reactive power optimization costs, both technically and strategically, is not only vital for the economic operation of the power system but also key to balancing interests among all parties and promoting the healthy development of the power market. Initially, the study analyzes and compares the characteristic curves of synchronous generators and DFIGs, establishes a reactive power pricing model for generators, and considering the randomness and volatility of wind energy, establishes a DFIG reactive power pricing model. The objective functions aimed to minimize the cost of reactive power purchased by generators, the price of active power network losses, the total deviation of node voltages, and the depreciation costs of discrete variable actions, thereby establishing a dynamic reactive power optimization model for power systems including doubly-fed wind farms. By introducing Logistic chaotic mapping, the CSA is improved by using the highly stochastic characteristics of chaotic systems, which is known as the Chaotic Cuckooing Algorithm. Meanwhile, the basic cuckoo search algorithm was improved in terms of adaptive adjustment strategies and global convergence guidance strategies, resulting in an enhanced cuckoo search algorithm to solve the established dynamic reactive power optimization model, improving global search capability and convergence speed. Finally, using the IEEE 30-bus system as an example and applying the improved chaotic cuckoo search algorithm for solution, simulation results show that the proposed reactive power optimization model and method can reduce reactive power costs and the number of discrete device actions, demonstrating effectiveness and adaptability. When the improved chaotic cuckoo algorithm is applied to optimize the objective function, the optimization result is better than 7.26% compared to the standard cuckoo search algorithm, and it is also improved compared to both the PSO algorithm and the GWO algorithm. Full article

The ball and balancer system is a popular research platform for studying underactuated mechanical systems and developing control algorithms. It is a well-known two-dimensional balancing problem that has been addressed by a variety of controllers. This research work proposes two controllers that are proportional integral derivative-second derivative-proportional integrator (${\mathrm{PIDD}}^2$-PI) controller and tilt integral derivative with filter (TID-F) controller in a multivariate, electromechanical, and nonlinear under-actuated ball and balancer system. Integral Time Absolute Error (ITAE) is an objective function used for designing controllers because of its ability to be more sensitive to overshooting as well as reduced settling time and steady-state error. As part of the analysis, four metaheuristic optimization algorithms are compared in the optimization of proposed control strategies for cascaded control of the ball and balancer system. The algorithms are the Grey Wolf optimization algorithm (GWO), Cuckoo Search algorithm (CSA), Gradient Base Optimization (GBO), and Whale Optimization Algorithm (WOA). The effectiveness of proposed controllers ${\mathrm{PIDD}}^2$-PI and TID-F is investigated to be better in terms of transient time response than proportional integral derivative (PID), proportional integral-derivative (PI-D), proportional integral-proportional derivative (PI-PD) and proportional integral derivative-second derivative-proportional derivative (${\mathrm{PIDD}}^2$-PD). Moreover, these two proposed controllers have also been compared with recently published work. During the analysis, it is shown that the proposed control strategies exhibit significantly greater robustness and dynamic responsiveness compared to other structural controllers. The proposed controller WOA-${\mathrm{PIDD}}^2$-PI reduced the 73.38% settling time and 88.16% rise time compared to classical PID. The other proposed controller GWO-TID-F reduced 58.06% the settling time and 26.96% rise time compared to classical PID. These results show that proposed controllers are particularly distinguished in terms of rise time, settling time, maximum overshoot, and set-point tracking. Full article

In the optimization field, the ability to efficiently tackle complex and high-dimensional problems remains a persistent challenge. Metaheuristic algorithms, with a particular emphasis on their autonomous variants, are emerging as promising tools to overcome this challenge. The term “autonomous” refers to these variants’ ability to dynamically adjust certain parameters based on their own outcomes, without external intervention. The objective is to leverage the advantages and characteristics of an unsupervised machine learning clustering technique to configure the population parameter with autonomous behavior, and emphasize how we incorporate the characteristics of search space clustering to enhance the intensification and diversification of the metaheuristic. This allows dynamic adjustments based on its own outcomes, whether by increasing or decreasing the population in response to the need for diversification or intensification of solutions. In this manner, it aims to imbue the metaheuristic with features for a broader search of solutions that can yield superior results. This study provides an in-depth examination of autonomous metaheuristic algorithms, including Autonomous Particle Swarm Optimization, Autonomous Cuckoo Search Algorithm, and Autonomous Bat Algorithm. We submit these algorithms to a thorough evaluation against their original counterparts using high-density functions from the well-known CEC LSGO benchmark suite. Quantitative results revealed performance enhancements in the autonomous versions, with Autonomous Particle Swarm Optimization consistently outperforming its peers in achieving optimal minimum values. Autonomous Cuckoo Search Algorithm and Autonomous Bat Algorithm also demonstrated noteworthy advancements over their traditional counterparts. A salient feature of these algorithms is the continuous nature of their population, which significantly bolsters their capability to navigate complex and high-dimensional search spaces. However, like all methodologies, there were challenges in ensuring consistent performance across all test scenarios. The intrinsic adaptability and autonomous decision making embedded within these algorithms herald a new era of optimization tools suited for complex real-world challenges. In sum, this research accentuates the potential of autonomous metaheuristics in the optimization arena, laying the groundwork for their expanded application across diverse challenges and domains. We recommend further explorations and adaptations of these autonomous algorithms to fully harness their potential. Full article

In today’s automation control systems, the PID controller, as a core technology, is widely used to maintain the system output near the set value. However, in some complex control environments, such as the application of ball screw-driven rotating motors, traditional PID parameter adjustment methods may not meet the requirements of high precision, high performance, and fast response time of the system, making it difficult to ensure the stability and production efficiency of the mechanical system. Therefore, this paper proposes a cuckoo search optimisation coupled with an improved grey wolf optimisation (CSO_IGWO) algorithm to tune PID controller parameters, aiming at resolving the problems of the traditional grey wolf optimisation (GWO) algorithm, such as slow optimisation speed, weak exploitation ability, and ease of falling into a locally optimal solution. First, the tent chaotic mapping method is used to initialise the population instead of using random initialization to enrich the diversity of individuals in the population. Second, the value of the control parameter is adjusted by the nonlinear decline method to balance the exploration and development capacity of the population. Finally, inspired by the cuckoo search optimisation (CSO) algorithm, the Levy flight strategy is introduced to update the position equation so that grey wolf individuals are enabled to make a big jump to expand the search area and not easily fall into local optimisation. To verify the effectiveness of the algorithm, this study first verifies the superiority of the improved algorithm with eight benchmark test functions. Then, comparing this method with the other two improved grey wolf algorithms, it can be seen that this method increases the average and standard deviation by an order of magnitude and effectively improves the global optimal search ability and convergence speed. Finally, in the experimental section, three parameter tuning methods were compared from four aspects: overshoot, steady-state time, rise time, and steady-state error, using the ball screw motor as the control object. In terms of overall dynamic performance, the method proposed in this article is superior to the other three parameter tuning methods. Full article

In this paper, a new hybrid Manta Ray Foraging Optimization (MRFO) with Cuckoo Search (CS) algorithm (AMRFOCS) is proposed. Firstly, quantum bit Bloch spherical coordinate coding is used for the initialization of the population, which improves the diversity of the expansion of the traversal ability of the search space. Secondly, the dynamic disturbance factor is introduced to balance the exploratory and exploitative search ability of the algorithm. Finally, the unique nesting strategy of the cuckoo and Levy flight is introduced to enhance the search ability. AMRFOCS is tested on CEC2017 and CEC2020 benchmark functions, which is also compared and tested by using different dimensions and other state-of-the-art metaheuristic algorithms. Experimental results reveal that the AMRFOCS algorithm has a superior convergence rate and optimization precision. At the same time, the nonparametric Wilcoxon signed-rank test and Friedman test show that the AMRFOCS has good stability and superiority. In addition, the proposed AMRFOCS is applied to the three-dimensional WSN coverage problem. Compared with the other four 3D deployment methods optimized by metaheuristic algorithms, the AMRFOCS effectively reduces the redundancy of sensor nodes, possesses a faster convergence speed and higher coverage and then provides a more effective and practical deployment scheme. Full article

The research of mobile robot path planning has shifted from the static environment to the dynamic environment, from the two-dimensional environment to the high-dimensional environment, and from the single-robot system to the multi-robot system. As the core technology for mobile robots to realize autonomous positioning and navigation, path-planning technology should plan collision-free and smooth paths for mobile robots in obstructed environments, which requires path-planning algorithms with a certain degree of intelligence. Metaheuristic algorithms are widely used in various optimization problems due to their algorithmic intelligence, and they have become the most effective algorithm to solve complex optimization problems in the field of mobile robot path planning. Based on a comprehensive analysis of existing path-planning algorithms, this paper proposes a new algorithm classification. Based on this classification, we focus on the firefly algorithm (FA) and the cuckoo search algorithm (CS), complemented by the dragonfly algorithm (DA), the whale optimization algorithm (WOA), and the sparrow search algorithm (SSA). During the analysis of the above algorithms, this paper summarizes the current research results of mobile robot path planning and proposes the future development trend of mobile robot path planning. Full article

The most important research area in robotics is navigation algorithms. Robot path planning (RPP) is the process of choosing the best route for a mobile robot to take before it moves. Finding an ideal or nearly ideal path is referred to as “path planning optimization.” Finding the best solution values that satisfy a single or a number of objectives, such as the shortest, smoothest, and safest path, is the goal. The objective of this study is to present an overview of navigation strategies for mobile robots that utilize three classical approaches, namely: the roadmap approach (RM), cell decomposition (CD), and artificial potential fields (APF), in addition to eleven heuristic approaches, including the genetic algorithm (GA), ant colony optimization (ACO), artificial bee colony (ABC), gray wolf optimization (GWO), shuffled frog-leaping algorithm (SFLA), whale optimization algorithm (WOA), bacterial foraging optimization (BFO), firefly (FF) algorithm, cuckoo search (CS), and bat algorithm (BA), which may be used in various environmental situations. Multiple issues, including dynamic goals, static and dynamic environments, multiple robots, real-time simulation, kinematic analysis, and hybrid algorithms, are addressed in a different set of articles presented in this study. A discussion, as well as thorough tables and charts, will be presented at the end of this work to help readers understand what types of strategies for path planning are developed for use in a wide range of ecological contexts. Therefore, this work’s main contribution is that it provides a broad view of robot path planning, which will make it easier for scientists to study the topic in the near future. Full article

Differential evolution is a popular algorithm for solving global optimization problems. When tested, it has reportedly outperformed both robotic problems and benchmarks. However, it may have issues with local optima or premature convergence. In this paper, we present a novel BODE-CS (Bidirectional Opposite Differential Evolution–Cuckoo Search) algorithm to solve the inverse kinematics problem of a six-DOF EOD (Explosive Ordnance Disposal) robot manipulator. The hybrid algorithm was based on the differential evolution algorithm and Cuckoo Search algorithm. To avoid any local optimum and accelerate the convergence of the swarm, various strategies were introduced. Firstly, a forward-kinematics model was established, and the objective function was formulated according to the structural characteristics of the robot manipulator. Secondly, a Halton sequence and an opposite search strategy were used to initialize the individuals in the swarm. Thirdly, the optimization algorithms applied to the swarm were dynamically allocated to the Differential Evolution algorithm or the Cuckoo algorithm. Fourthly, a composite differential algorithm, which consisted of a dynamically opposite differential strategy, a bidirectional search strategy, and two other typically used differential strategies were introduced to maintain the diversity of the swarm. Finally, two adaptive parameters were introduced to optimize the amplification factor F and cross-over probability C_r. To verify the performance of the BODE-CS algorithm, two different tasks were tested. The experimental results of the simulation showed that the BODE-CS algorithm had high accuracy and a fast convergence rate, which met the requirements of an inverse solution for the manipulator. Full article

The amount of energy that a thermoelectric generator (TEG) is capable of harvesting mainly depends on the temperature difference between the hot and cold sides of the TEG. To ensure that the TEG operates efficiently under any condition or temperature variation, it is crucial to have a reliable MPPT that keeps the TEG as close as possible to its MPP. Fractional control is usually preferred over integer control because it allows for more precise, flexible, and robust control over a system. The controller parameters in fractional control are not limited to integer values, but rather can have fractional values, which enables more precise control of the system’s dynamics. In this paper, an optimized fractional PID-based MPPT that effectively addresses two primary issues, dynamic response and oscillation around MPP, is proposed. Firstly, the five unknown parameters of the optimized fractional PID-based MPPT were estimated by the BES “bald eagle search” algorithm. To validate the superiority of the BES, the results were compared with those obtained using other optimization algorithms, such as ant lion optimizer (ALO), equilibrium optimizer (EO), cuckoo search (CS), and WOA “whale optimization algorithm”. The results demonstrate that BES outperforms ALO, EO, CS, and WOA. Additionally, the tracking performance of proposed MPPT was evaluated using two scenarios that involved variations in temperature differences and sudden changes in the load demanded. Overall, the proposed optimized fractional PID-based MPPT effectively improves dynamic performance and eliminates oscillation around MPP under steady state compared to other tracking methods, such as P&O “perturb and observe” and incremental conductance (INR). Full article