Publication Search

Accurate wind turbine power curve modeling plays a crucial role in performance evaluation, energy yield estimation, and data-driven control strategies. However, actual power curves often exhibit non-linear behavior influenced by atmospheric variability, measurement noise, and SCADA anomalies, making conventional modeling approaches less effective. This study proposes an optimized logistic power curve model whose parameters are tuned using Particle Swarm Optimization (PSO) to improve predictive accuracy. The analysis uses the Wind Turbine SCADA Dataset from Kaggle, which undergoes extensive preprocessing including physical rule filtering, outlier detection with the Interquartile Range (IQR) method, anomaly removal, and smoothing of the power signal. A three-parameter logistic model is selected due to its ability to capture the typical S-shaped relationship between wind speed and power output. PSO is applied to identify optimal model parameters by minimizing the Mean Squared Error (MSE), utilizing 40 particles over 200 iterations. The optimized model achieves strong predictive performance with RMSE of 404.09, MAE of 179.96, and R² of 0.904 on the test set, indicating that more than 90% of the variability in actual power can be explained by wind speed. Residual analysis reveals heteroscedastic patterns and slight overestimation in mid-range wind speeds, yet overall model consistency remains high. Comparative evaluation against Linear Regression, Random Forest, and logistic modeling using curve_fit shows that the Logistic–PSO approach provides the most accurate and stable predictions. These findings demonstrate that combining logistic modeling with PSO offers an effective and robust method for data-driven wind turbine power curve optimization.

This research explores the effectiveness of heuristic techniques for solving combinatorial optimization problems, with a particular focus on the Traveling Salesman Problem (TSP). Combinatorial optimization is a critical area of study, especially in fields like computer science, engineering, and economics, where finding optimal solutions from a finite set of possibilities is crucial. However, the NP-hard nature of many combinatorial problems, such as the TSP, makes traditional exact methods like Branch-and-Bound and Dynamic Programming computationally expensive and inefficient for larger problem sizes. The primary objective of this research is to evaluate the performance of heuristic methods, including Simulated Annealing (SA), Genetic Algorithms (GA), and Iterative Computation techniques, such as Tabu Search (TS) and Particle Swarm Optimization (PSO). These methods are tested for their ability to provide approximate solutions efficiently. The findings reveal that while ACO provided the best solution quality, it had the longest runtime. TS was the fastest, though with slightly lower solution quality. SA and GA demonstrated a balance between solution quality and computational efficiency, but their performance heavily depended on parameter tuning. The hybridization of SA and GA showed potential for improving solution quality but introduced additional complexity. The research concludes that heuristic methods, especially when combined, offer viable solutions for large-scale combinatorial optimization problems, though the trade-off between solution quality and computational time must be considered when selecting an algorithm.

Minimally invasive surgery offers several advantages, including reduced blood loss, smaller incisions, less pain, and a lower risk of complications than open surgery. This approach enhances patient comfort and supports faster recovery. When guided by optimal path planning, surgical robots can accurately navigate the body to remove malignant tumors with high precision. This study proposes a Modified Particle Swarm Optimization (MPSO) algorithm to determine the optimal path for robotic-assisted minimally invasive surgery targeting brain tumors. The algorithm improves upon standard PSO by modifying the velocity update equation and incorporating an adaptive inertia weight, enhancing convergence speed, global search ability, and solution accuracy. Experimental results show that the proposed MPSO achieves a maximum fitness value of 19.10 in a sparse obstacle environment, outperforming standard PSO and IPSO in quality and in the required number of iterations. The approach effectively balances path efficiency and obstacle avoidance, making it well-suited for complex surgical scenarios. In conclusion, the MPSO-based method provides a reliable and precise solution for robotic surgical navigation, improving outcomes and safety in minimally invasive procedures.

The application of algorithms in the mentoring activity scheduling system is an innovative solution to overcome the complexity of time and resource management. This study aims to develop a mentoring activity scheduling system for Reading and Writing the Qur'an (BTQ) using the particle swarm optimization (PSO) algorithm. The PSO algorithm was chosen because of its ability to find optimal solutions efficiently through a particle population approach. This system is designed to meet the schedule preferences of students and supervisors, taking into account the limited time available and the interrelationships between schedules. This study makes a significant contribution to improving the efficiency of BTQ mentoring activity scheduling, as well as demonstrating the potential of PSO in solving other scheduling problems.

Task scheduling in cloud computing environments is a crucial aspect in optimizing resource allocation and improving system efficiency. This research aims to analyze trends in task scheduling algorithms in cloud computing using a Systematic Literature Review (SLR) approach on various scientific publications published between 2018 and 2025. The results of the study show that Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), and Genetic Algorithm (GA) algorithms are the most commonly used methods in solving task scheduling problems. PSO stands out as an effective algorithm due to its ability to find global optimal solutions, handle non-linear and multimodal problems, and its efficiency in managing computational resources. Additionally, various studies have shown that optimization of scheduling algorithms can be achieved through a combination or modification of existing methods to improve system performance. This study provides in-depth insights into the development of scheduling algorithms in cloud computing and opens up opportunities for further research in developing more innovative and adaptive approaches.