To expand the information of nest individuals, the idea of complex-valued encoding is used in cuckoo search (PCS); the gene of individuals is denoted by plurality, so a diploid swarm is structured by a sequence plurality. The value of independent variables for objective function is determined by modules, and a sign of them is determined by angles. The position of nest is divided into two parts, namely, real part gene and imaginary gene. The updating relation of complex-valued swarm is presented. Six typical functions are tested. The results are compared with cuckoo search based on real-valued encoding; the usefulness of the proposed algorithm is verified.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3677629 | PMC |
http://dx.doi.org/10.1155/2013/597803 | DOI Listing |
Sci Rep
January 2025
Department of Theoretical Electrical Engineering and Diagnostics of Electrical Equipment, Institute of Electrodynamics, National Academy of Sciences of Ukraine, Beresteyskiy, 56, Kyiv-57, Kyiv, 03680, Ukraine.
This study investigates the optimization of wind energy integration in hybrid micro grids (MGs) to address the rising demand for renewable energy, particularly in regions with limited wind potential. A comprehensive assessment of wind energy potential was conducted, and optimal sizing of standalone MGs incorporating photovoltaic (PV) systems, wind turbines (WT), and battery storage (BS) systems was performed for six regions in the Kingdom Saudi Arabia. Wind resource analysis utilizing the Weibull distribution function shows that all regions exhibited Class 1 wind energy characteristics, with average annual wind power densities ranging from 36.
View Article and Find Full Text PDFPLoS One
January 2025
Computer Science and Engineering Discipline, Khulna University, Khulna, Bangladesh.
The objective of the max-cut problem is to cut any graph in such a way that the total weight of the edges that are cut off is maximum in both subsets of vertices that are divided due to the cut of the edges. Although it is an elementary graph partitioning problem, it is one of the most challenging combinatorial optimization-based problems, and tons of application areas make this problem highly admissible. Due to its admissibility, the problem is solved using the Harris Hawk Optimization algorithm (HHO).
View Article and Find Full Text PDFDiagnostics (Basel)
December 2024
Department of Information Systems, College of Computer and Information Sciences, Jouf University, Sakaka 72388, Saudi Arabia.
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.
View Article and Find Full Text PDFSci Rep
December 2024
Department of Electrical and Electronics Engineering, Engineering Faculty, Düzce University, Düzce, Turkey.
The study suggests a better multi-objective optimization method called 2-Archive Multi-Objective Cuckoo Search (MOCS2arc). It is then used to improve eight classical truss structures and six ZDT test functions. The optimization aims to minimize both mass and compliance simultaneously.
View Article and Find Full Text PDFSurg Innov
December 2024
Department of Computer Engineering, College of Computer and Information Sciences, King Saud University, Riyadh, Saudi Arabia.
In recent days, bone cancer is a life-threatening health issue that can lead to death. However, physicians use CT-scan, X-rays, or MRI images to recognize bone cancer, but still require techniques to increase precision and reduce human labor. These methods face challenges such as high costs, time consumption, and the risk of misdiagnosis due to the complexity of bone tumor appearances.
View Article and Find Full Text PDFEnter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!