Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

remove_circle_outline
remove_circle_outline
remove_circle_outline

Search Results (316)

Search Parameters:
Keywords = cuckoo search

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
21 pages, 3663 KB  
Article
Enhanced Cuckoo Search Optimization with Opposition-Based Learning for the Optimal Placement of Sensor Nodes and Enhanced Network Coverage in Wireless Sensor Networks
by Mandli Rami Reddy, M. L. Ravi Chandra and Ravilla Dilli
Appl. Sci. 2025, 15(15), 8575; https://doi.org/10.3390/app15158575 - 1 Aug 2025
Viewed by 225
Abstract
Network connectivity and area coverage are the most important aspects in the applications of wireless sensor networks (WSNs). The resource and energy constraints of sensor nodes, operational conditions, and network size pose challenges to the optimal coverage of targets in the region of [...] Read more.
Network connectivity and area coverage are the most important aspects in the applications of wireless sensor networks (WSNs). The resource and energy constraints of sensor nodes, operational conditions, and network size pose challenges to the optimal coverage of targets in the region of interest (ROI). The main idea is to achieve maximum area coverage and connectivity with strategic deployment and the minimal number of sensor nodes. This work addresses the problem of network area coverage in randomly distributed WSNs and provides an efficient deployment strategy using an enhanced version of cuckoo search optimization (ECSO). The “sequential update evaluation” mechanism is used to mitigate the dependency among dimensions and provide highly accurate solutions, particularly during the local search phase. During the preference random walk phase of conventional CSO, particle swarm optimization (PSO) with adaptive inertia weights is defined to accelerate the local search capabilities. The “opposition-based learning (OBL)” strategy is applied to ensure high-quality initial solutions that help to enhance the balance between exploration and exploitation. By considering the opposite of current solutions to expand the search space, we achieve higher convergence speed and population diversity. The performance of ECSO-OBL is evaluated using eight benchmark functions, and the results of three cases are compared with the existing methods. The proposed method enhances network coverage with a non-uniform distribution of sensor nodes and attempts to cover the whole ROI with a minimal number of sensor nodes. In a WSN with a 100 m2 area, we achieved a maximum coverage rate of 98.45% and algorithm convergence in 143 iterations, and the execution time was limited to 2.85 s. The simulation results of various cases prove the higher efficiency of the ECSO-OBL method in terms of network coverage and connectivity in WSNs compared with existing state-of-the-art works. Full article
Show Figures

Figure 1

21 pages, 1573 KB  
Article
Photovoltaic Panel Parameter Estimation Enhancement Using a Modified Quasi-Opposition-Based Killer Whale Optimization Technique
by Cilina Touabi, Abderrahmane Ouadi, Hamid Bentarzi and Abdelmadjid Recioui
Sustainability 2025, 17(11), 5161; https://doi.org/10.3390/su17115161 - 4 Jun 2025
Viewed by 444
Abstract
Photovoltaic (PV) energy generation has seen rapid growth in recent years due to its sustainability and environmental benefits. However, accurately identifying PV panel parameters is crucial for enhancing system performance, especially under varying environmental conditions. This study presents an enhanced approach for estimating [...] Read more.
Photovoltaic (PV) energy generation has seen rapid growth in recent years due to its sustainability and environmental benefits. However, accurately identifying PV panel parameters is crucial for enhancing system performance, especially under varying environmental conditions. This study presents an enhanced approach for estimating PV panel parameters using a Modified Quasi-Opposition-Based Killer Whale Optimization (MQOB-KWO) technique. The research aims to improve parameter extraction accuracy by optimizing the one-diode model (ODM), a widely used representation of PV cells, using a modified metaheuristic optimization technique. The proposed algorithm leverages a Quasi-Opposition-Based Learning (QOBL) mechanism to enhance search efficiency and convergence speed. The methodology involves implementing the MQOB-KWO in MATLAB R2021a and evaluating its effectiveness through experimental I-V data from two unlike photovoltaic panels. The findings are contrasted to established optimization techniques from the literature, such as the original Killer Whale Optimization (KWO), Improved Opposition-Based Particle Swarm Optimization (IOB-PSO), Improved Cuckoo Search Algorithm (ImCSA), and Chaotic Improved Artificial Bee Colony (CIABC). The findings demonstrate that the proposed MQOB-KWO achieves superior accuracy with the lowest Root Mean Square Error (RMSE) compared to other methods, and the lowest error rates (Root Mean Square Error—RMSE, and Integral Absolute Error—IAE) compared to the original KWO, resulting in a better value of the coefficient of determination (R2), hence effectively capturing PV module characteristics. Additionally, the algorithm shows fast convergence, making it suitable for real-time PV system modeling. The study confirms that the proposed optimization technique is a reliable and efficient tool for improving PV parameter estimation, contributing to better system efficiency and operational performance. Full article
(This article belongs to the Section Energy Sustainability)
Show Figures

Figure 1

28 pages, 2804 KB  
Article
Adaptive Network-Based Fuzzy Inference System Training Using Nine Different Metaheuristic Optimization Algorithms for Time-Series Analysis of Brent Oil Price and Detailed Performance Analysis
by Ebubekir Kaya, Ahmet Kaya and Ceren Baştemur Kaya
Symmetry 2025, 17(5), 786; https://doi.org/10.3390/sym17050786 - 19 May 2025
Viewed by 560
Abstract
Brent oil holds a significant position in the global energy market, as oil prices in many regions are indexed to it. Therefore, forecasting the future price of Brent oil is of great importance. In recent years, artificial intelligence techniques have been widely applied [...] Read more.
Brent oil holds a significant position in the global energy market, as oil prices in many regions are indexed to it. Therefore, forecasting the future price of Brent oil is of great importance. In recent years, artificial intelligence techniques have been widely applied in modeling and prediction tasks. In this study, an Adaptive Neuro-Fuzzy Inference System (ANFIS), a well-established AI approach, was employed for the time-series forecasting of Brent oil prices. To ensure effective learning and improve prediction accuracy, ANFIS was trained using nine different metaheuristic algorithms: Artificial Bee Colony (ABC), Selfish Herd Optimizer (SHO), Biogeography-Based Optimization (BBO), Multi-Verse Optimizer (MVO), Teaching–Learning-Based Optimization (TLBO), Cuckoo Search (CS), Moth Flame Optimization (MFO), Marine Predator Algorithm (MPA), and Flower Pollination Algorithm (FPA). Symmetric training procedures were applied across all algorithms to ensure fair and consistent evaluation. The analyses were conducted on the lowest and highest daily, weekly, and monthly Brent oil prices. Mean squared error (MSE) was used as the primary performance metric. The results showed that all algorithms achieved effective prediction performance. Among them, BBO and TLBO demonstrated superior accuracy and stability, particularly in handling the complexities of Brent oil forecasting. This study contributes to the literature by combining ANFIS and metaheuristics within a symmetric framework of experimentation and evaluation. Full article
Show Figures

Figure 1

23 pages, 1465 KB  
Article
Quantum Snowflake Algorithm (QSA): A Snowflake-Inspired, Quantum-Driven Metaheuristic for Large-Scale Continuous and Discrete Optimization with Application to the Traveling Salesman Problem
by Zeki Oralhan and Burcu Oralhan
Appl. Sci. 2025, 15(9), 5117; https://doi.org/10.3390/app15095117 - 4 May 2025
Cited by 1 | Viewed by 1041
Abstract
The Quantum Snowflake Algorithm (QSA) is a novel metaheuristic for both continuous and discrete optimization problems, combining collision-based diversity, quantum-inspired tunneling, superposition-based partial solution sharing, and local refinement steps. The QSA embeds candidate solutions in a continuous auxiliary space, where collision operators ensure [...] Read more.
The Quantum Snowflake Algorithm (QSA) is a novel metaheuristic for both continuous and discrete optimization problems, combining collision-based diversity, quantum-inspired tunneling, superposition-based partial solution sharing, and local refinement steps. The QSA embeds candidate solutions in a continuous auxiliary space, where collision operators ensure that agents—snowflakes—reject each other and remain diverse. This approach is inspired by snowflakes which prevent collisions while retaining unique crystalline patterns. Large leaps to escape deep local minima are simultaneously provided by quantum tunneling, which is particularly useful in highly multimodal environments. Tests on challenging functions like Lévy and HyperSphere showed that the QSA can more reliably obtain very low objective values in continuous domains than conventional swarm or evolutionary approaches. A 200-city Traveling Salesman Problem (TSP) confirmed the excellent tour quality of the QSA for discrete optimization. It drastically reduces the route length compared to Artificial Bee Colony (ABC), Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Simulated Annealing (SA), Quantum Particle Swarm Optimization (QPSO), and Cuckoo Search (CS). These results show that quantum tunneling accelerates escape from local traps, superposition and local search increase exploitation, and collision-based repulsion maintains population diversity. Together, these elements provide a well-rounded search method that is easy to adapt to different problem areas. In order to establish the QSA as a versatile solution framework for a range of large-scale optimization challenges, future research could investigate multi-objective extensions, adaptive parameter control, and more domain-specific hybridisations. Full article
Show Figures

Figure 1

20 pages, 6256 KB  
Article
Spiking Neural Networks Optimized by Improved Cuckoo Search Algorithm: A Model for Financial Time Series Forecasting
by Panke Qin, Yongjie Ding, Ya Li, Bo Ye, Zhenlun Gao, Yaxing Liu, Zhongqi Cai and Haoran Qi
Algorithms 2025, 18(5), 262; https://doi.org/10.3390/a18050262 - 2 May 2025
Viewed by 722
Abstract
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 [...] Read more.
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 (R2) 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
(This article belongs to the Special Issue Algorithms in Nonsmooth Optimization)
Show Figures

Figure 1

23 pages, 3404 KB  
Article
Lightweight Anomaly-Based Detection Using Cuckoo Search Algorithm and Decision Tree to Mitigate Man-in-the-Middle Attacks in DNS
by Ramahlapane Lerato Moila and Mthulisi Velempini
Appl. Sci. 2025, 15(9), 5017; https://doi.org/10.3390/app15095017 - 30 Apr 2025
Viewed by 480
Abstract
As technology advances, the services provided by domain servers require new innovative techniques that can be optimized for frequent changes. Man-in-the-Middle (MitM) attacks on Domain Name Servers (DNS) pose a security threat, enabling attackers to intercept, modify, and redirect network traffic to malicious [...] Read more.
As technology advances, the services provided by domain servers require new innovative techniques that can be optimized for frequent changes. Man-in-the-Middle (MitM) attacks on Domain Name Servers (DNS) pose a security threat, enabling attackers to intercept, modify, and redirect network traffic to malicious sites or users. This study designed an anomaly-based detection scheme that identifies and mitigates MitM attacks on DNS. The proposed model utilizes machine learning algorithms and statistical analysis techniques to ensure that the analysis of DNS query patterns can efficiently detect anomalies associated with the MitM. By integrating the Cuckoo Search Algorithm, the scheme minimizes false positives while improving the detection rate. The Proposed scheme was evaluated using the Internet of Things Intrusion Detection (IoTID) and Intrusion Detection System (IDS) datasets, achieving a detection accuracy of 99.6% and demonstrating its effectiveness in minimizing the MitM attacks on DNS. Full article
Show Figures

Figure 1

27 pages, 1927 KB  
Article
A New Bipolar Approach Based on the Rooster Algorithm Developed for Utilization in Optimization Problems
by Mashar Cenk Gençal
Appl. Sci. 2025, 15(9), 4921; https://doi.org/10.3390/app15094921 - 29 Apr 2025
Cited by 1 | Viewed by 371
Abstract
Meta-heuristic algorithms are computational methods inspired by evolutionary processes, animal or plant behaviors, physical events, and other natural phenomena. Due to their success in solving optimization problems, meta-heuristic algorithms are widely used in the literature, leading to the development of novel variants. In [...] Read more.
Meta-heuristic algorithms are computational methods inspired by evolutionary processes, animal or plant behaviors, physical events, and other natural phenomena. Due to their success in solving optimization problems, meta-heuristic algorithms are widely used in the literature, leading to the development of novel variants. In this paper, new swarm-based meta-heuristic algorithms, called Improved Roosters Algorithm (IRA), Bipolar Roosters Algorithm (BRA), and Bipolar Improved Roosters Algorithm (BIRA), which are mainly based on Roosters Algorithm (RA), are presented. First, the new versions of RA (IRA, BRA, and BIRA) were compared in terms of performance, revealing that BIRA achieved significantly better results than the other variants. Then, the performance of the BIRA algorithm was compared with the performances of meta-heuristic algorithms widely used in the literature, Standard Genetic Algorithm (SGA), Differential Evolution (DE), Particle Swarm Optimization (PSO), Cuckoo Search (CS), and Grey Wolf Optimizer (GWO), and thus, its success in the literature was tested. Moreover, RA was also included in this test to show that the new version, BIRA, is more successful than the previous one (RA). For all comparisons, 20 well-known benchmark optimization functions, 11 CEC2014 test functions, and 17 CEC2018 test functions, which are also in the CEC2020 test suite, were employed. To validate the significance of the results, Friedman and Wilcoxon Signed Rank statistical tests were conducted. In addition, three commonly used problems in the field of engineering were used to test the success of algorithms in real-life scenarios: pressure vessel, gear train, and tension/compression spring design. The results indicate that the proposed algorithm (BIRA) provides better performance compared to the other meta-heuristic algorithms. Full article
Show Figures

Figure 1

17 pages, 2455 KB  
Article
Power Harvested Maximization for Solar Photovoltaic Energy System Under Static and Dynamic Conditions
by Abdullrahman A. Al-Shamma’a and Hassan M. Hussein Farh
Appl. Sci. 2025, 15(8), 4486; https://doi.org/10.3390/app15084486 - 18 Apr 2025
Cited by 1 | Viewed by 451
Abstract
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 [...] Read more.
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
(This article belongs to the Special Issue New Technologies for Power Electronic Converters and Inverters)
Show Figures

Figure 1

21 pages, 9636 KB  
Article
Low-Carbon Control of Integrated Energy by Combining Cuckoo Search Algorithm and Particle Swarm Optimization Algorithm
by Dandan Wang, Jian Guan, Hongyan Liu, Hanwen Zhang, Qi Wang, Lijian Zhang and Jingzheng Dong
Sustainability 2025, 17(7), 3206; https://doi.org/10.3390/su17073206 - 3 Apr 2025
Viewed by 430
Abstract
With the increasing severity of global climate change, low-carbon development has become a key issue in the energy industry. As an effective way to optimize energy utilization and reduce carbon emissions, integrated energy system is receiving increasing attention. However, existing low-carbon control methods [...] Read more.
With the increasing severity of global climate change, low-carbon development has become a key issue in the energy industry. As an effective way to optimize energy utilization and reduce carbon emissions, integrated energy system is receiving increasing attention. However, existing low-carbon control methods still face many challenges in improving system efficiency and reducing carbon emissions, and the ability of multi-energy cooperative scheduling and optimal control is insufficient. Therefore, a hybrid algorithm combining the particle swarm optimization and cuckoo search algorithms is designed to adjust the integrated energy low-carbon control capability. The proposed algorithm required fewer iterations than the genetic cuckoo algorithm, which only went through 43 iterations. The convergence speed was improved by 34.8% compared with a single cuckoo algorithm. Among the four scenarios, scenario 4 and scenario 3 had the highest utilization rates of 99.75%, while scenario 1 had the lowest utilization rate of 61.96%. This indicates that the integrated energy system controlled by the particle swarm optimization cuckoo algorithm, while considering carbon capture and storage as well as power-to-gas conversion, can effectively utilize solar energy resources for power generation and achieve energy-saving and emission reduction effects. In summary, this method can help the integrated energy system adapt to various optimization strategies, which promotes the development of low-carbon control technologies in the energy industry. Full article
(This article belongs to the Special Issue Innovation and Low Carbon Sustainability in the Digital Age)
Show Figures

Figure 1

30 pages, 5977 KB  
Article
Enhanced Numerical Solutions for Fractional PDEs Using Monte Carlo PINNs Coupled with Cuckoo Search Optimization
by Tauqeer Ahmad, Muhammad Sulaiman, David Bassir, Fahad Sameer Alshammari and Ghaylen Laouini
Fractal Fract. 2025, 9(4), 225; https://doi.org/10.3390/fractalfract9040225 - 2 Apr 2025
Cited by 1 | Viewed by 1134
Abstract
In this study, we introduce an innovative approach for addressing fractional partial differential equations (fPDEs) by combining Monte Carlo-based physics-informed neural networks (PINNs) with the cuckoo search (CS) optimization algorithm, termed PINN-CS. There is a further enhancement in the application of quasi-Monte Carlo [...] Read more.
In this study, we introduce an innovative approach for addressing fractional partial differential equations (fPDEs) by combining Monte Carlo-based physics-informed neural networks (PINNs) with the cuckoo search (CS) optimization algorithm, termed PINN-CS. There is a further enhancement in the application of quasi-Monte Carlo assessment that comes with high efficiency and computational solutions to estimates of fractional derivatives. By employing structured sampling nodes comparable to techniques used in finite difference approaches on staggered or irregular grids, the proposed PINN-CS minimizes storage and computation costs while maintaining high precision in estimating solutions. This is supported by numerous numerical simulations to analyze various high-dimensional phenomena in various environments, comprising two-dimensional space-fractional Poisson equations, two-dimensional time-space fractional diffusion equations, and three-dimensional fractional Bloch–Torrey equations. The results demonstrate that PINN-CS achieves superior numerical accuracy and computational efficiency compared to traditional fPINN and Monte Carlo fPINN methods. Furthermore, the extended use to problem areas with irregular geometries and difficult-to-define boundary conditions makes the method immensely practical. This research thus lays a foundation for more adaptive and accurate use of hybrid techniques in the development of the fractional differential equations and in computing science and engineering. Full article
(This article belongs to the Special Issue Advanced Numerical Methods for Fractional Functional Models)
Show Figures

Figure 1

26 pages, 2528 KB  
Article
Bi-Objective Optimization for Joint Time-Invariant Allocation of Berths and Quay Cranes
by Xiaomei Zhang, Ziang Liu, Jialiang Zhang, Yuhang Zeng and Chuannian Fan
Appl. Sci. 2025, 15(6), 3035; https://doi.org/10.3390/app15063035 - 11 Mar 2025
Cited by 2 | Viewed by 818
Abstract
With the increasingly busy transportation of cargo at container terminals (CTs), the requirements for terminal throughput and operational efficiency are constantly increasing. The operational efficiency and cost of CTs are closely related to the seamless docking of terminal facilities, especially the joint operation [...] Read more.
With the increasingly busy transportation of cargo at container terminals (CTs), the requirements for terminal throughput and operational efficiency are constantly increasing. The operational efficiency and cost of CTs are closely related to the seamless docking of terminal facilities, especially the joint operation between berths and quay cranes (QCs). Therefore, a joint allocation problem of berths and QCs (BACASP) is presented in this paper and formalized as a mathematical model to minimize terminal operation costs and shipowner dissatisfaction. Given that BACASP is an NP-hard problem, an improved multi-objective cuckoo search (IMOCS) algorithm is proposed to solve this problem, in which an elite-guided tangent flight strategy is presented to speed up the convergence for making up the lack of random search direction of the traditional cuckoo search algorithm; and an information-enhanced abandonment strategy is put forward to increase the possibility of escaping from local optima. Numerical experimental results show the effectiveness of the proposed algorithm. Full article
(This article belongs to the Special Issue AI-Based Methods for Object Detection and Path Planning)
Show Figures

Figure 1

25 pages, 5090 KB  
Article
Research on Intelligent Verification of Equipment Information in Engineering Drawings Based on Deep Learning
by Zicheng Zhang and Yurou He
Electronics 2025, 14(4), 814; https://doi.org/10.3390/electronics14040814 - 19 Feb 2025
Viewed by 819
Abstract
This paper focuses on the crucial task of automatic recognition and understanding of table structures in engineering drawings and document processing. Given the importance of tables in information display and the urgent need for automated processing of tables in the digitalization process, an [...] Read more.
This paper focuses on the crucial task of automatic recognition and understanding of table structures in engineering drawings and document processing. Given the importance of tables in information display and the urgent need for automated processing of tables in the digitalization process, an intelligent verification method is proposed. This method integrates multiple key techniques: YOLOv10 is used for table object recognition, achieving a precision of 0.891, a recall rate of 0.899, mAP50 of 0.922, and mAP50-95 of 0.677 in table recognition, demonstrating strong target detection capabilities; the improved LORE algorithm is adopted to extract table structures, breaking through the limitations of the original algorithm by segmenting large-sized images, with a table extraction accuracy rate reaching 91.61% and significantly improving the accuracy of handling complex tables; RapidOCR is utilized to achieve text recognition and cell correspondence, solving the problem of text-cell matching; for equipment name semantic matching, a method based on BERT is introduced and calculated using a comprehensive scoring method. Meanwhile, an improved cuckoo search algorithm is proposed to optimize the adjustment factors, avoiding local optima through sine optimization and the catfish effect. Experiments show the accuracy of equipment name matching in semantic similarity calculation approaches 100%. Finally, the paper provides a concrete system practice to prove the effectiveness of the algorithm. In conclusion, through experimental comparisons, this method exhibits excellent performance in table area location, structure recognition, and semantic matching and is of great significance and practical value in advancing table data processing technology in engineering drawings. Full article
(This article belongs to the Section Artificial Intelligence)
Show Figures

Figure 1

30 pages, 6643 KB  
Article
Optimized Machine Learning for the Early Detection of Polycystic Ovary Syndrome in Women
by Bharti Panjwani, Jyoti Yadav, Vijay Mohan, Neha Agarwal and Saurabh Agarwal
Sensors 2025, 25(4), 1166; https://doi.org/10.3390/s25041166 - 14 Feb 2025
Cited by 3 | Viewed by 3791
Abstract
Polycystic ovary syndrome (PCOS) is a medical condition that impacts millions of women worldwide; however, due to a lack of public awareness, as well as the expensive testing involved in the identification of PCOS, 70% of cases go undiagnosed. Therefore, the primary objective [...] Read more.
Polycystic ovary syndrome (PCOS) is a medical condition that impacts millions of women worldwide; however, due to a lack of public awareness, as well as the expensive testing involved in the identification of PCOS, 70% of cases go undiagnosed. Therefore, the primary objective of this study is to design an expert machine learning (ML) model for the early diagnosis of PCOS based on initial symptoms and health indicators; two datasets were amalgamated and preprocessed to accomplish this goal, resulting in a new symptomatic dataset with 12 attributes. An ensemble learning (EL) model, with seven base classifiers, and a deep learning (DL) model, as the meta-level classifier, are proposed. The hyperparameters of the EL model were optimized through the nature-inspired walrus optimization (WaO), cuckoo search optimization (CSO), and random search optimization (RSO) algorithms, leading to the WaOEL, CSOEL, and RSOEL models, respectively. The results obtained prove the supremacy of the designed WaOEL model over the other models, with a PCOS prediction accuracy of 92.8% and an area under the receiver operating characteristic curve (AUC) of 0.93; moreover, feature importance analysis, presented with random forest (RF) and Shapley additive values (SHAP) for positive PCOS predictions, highlights crucial clinical insights and the need for early intervention. Our findings suggest that patients with features related to obesity and high cholesterol are more likely to be diagnosed as PCOS positive. Most importantly, it is inferred from this study that early PCOS identification without expensive tests is possible with the proposed WaOEL, which helps clinicians and patients make better informed decisions, identify comorbidities, and reduce the harmful long-term effects of PCOS. Full article
(This article belongs to the Special Issue Recent Advances in Biomedical Imaging Sensors and Processing)
Show Figures

Figure 1

26 pages, 5463 KB  
Article
Intelligent Congestion Control in Wireless Sensor Networks (WSN) Based on Generative Adversarial Networks (GANs) and Optimization Algorithms
by Seyed Salar Sefati, Bahman Arasteh, Razvan Craciunescu and Ciprian-Romeo Comsa
Mathematics 2025, 13(4), 597; https://doi.org/10.3390/math13040597 - 12 Feb 2025
Cited by 2 | Viewed by 1332
Abstract
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 [...] Read more.
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
Show Figures

Figure 1

27 pages, 2982 KB  
Article
A Social Group Optimization Algorithm Using the Laplace Operator for the Economic Dispatch Problem
by Dinu Calin Secui, Cristina Hora, Florin Ciprian Dan, Monica Liana Secui, Horea Nicolae Hora and Emil Gligor
Processes 2025, 13(2), 405; https://doi.org/10.3390/pr13020405 - 4 Feb 2025
Cited by 1 | Viewed by 880
Abstract
The economic dispatch (ED) problem focuses on the optimal scheduling of thermal generating units in a power system to minimize fuel costs while satisfying operational constraints. This article proposes a modified version of the social group optimization (SGO) algorithm to address the ED [...] Read more.
The economic dispatch (ED) problem focuses on the optimal scheduling of thermal generating units in a power system to minimize fuel costs while satisfying operational constraints. This article proposes a modified version of the social group optimization (SGO) algorithm to address the ED problem with various practical characteristics (such as valve-point effects, transmission losses, prohibited operating zones, and multi-fuel sources). SGO is a population-based metaheuristic algorithm with strong exploration capabilities, but for certain types of problems, it may stagnate in a local optimum due to a potential imbalance between exploration and exploitation. The new version, named SGO-L, retains the structure of the SGO but incorporates a Laplace operator derived from the Laplace distribution into all the iterative solution update equations. This adjustment generates more effective search steps in the solution space, improving the exploration–exploitation balance and overall performance in terms of solution stability and quality. SGO-L is validated on four power systems of small (six-unit), medium (10-unit), and large (40-unit and 110-unit) sizes with diverse characteristics. The efficiency of SGO-L is compared with SGO and other metaheuristic algorithms. The experimental results demonstrate that the proposed SGO-L algorithm is more robust than well-known algorithms (such as particle swarm optimization, genetic algorithms, differential evolution, and cuckoo search algorithms) and other competitor algorithms mentioned in the study. Moreover, the non-parametric Wilcoxon statistical test indicates that the new SGO-L version is more promising than the original SGO in terms of solution stability and quality. For example, the standard deviation obtained by SGO-L shows significantly lower values (6.02 × 10−9 USD/h for the six-unit system, 7.56 × 10−5 USD/h for the 10-unit system, 75.89 USD/h for the 40-unit system, and 4.80 × 10−3 USD/h for the 110-unit system) compared to SGO (0.44 USD/h for the six-unit system, 50.80 USD/h for the 10-unit system, 274.91 USD/h for the 40-unit system, and 1.04 USD/h for the 110-unit system). Full article
(This article belongs to the Section Energy Systems)
Show Figures

Figure 1

Back to TopTop