Optimal Power Flow (OPF) is a critical challenge in electrical engineering, necessitating efficient and resilient optimization techniques for successful power distribution management. This study presents COGWO, an innovative hybrid metaheuristic that integrates the Grey Wolf Optimizer (GWO) with the Cuckoo Optimization Algorithm (COA) to enhance convergence quality and solution resilience. Before its implementation in OPF issues, the suggested technique was thoroughly verified against standard engineering problems in CEC2020, continuously surpassing several state-of-the-art methods. Subsequently, COGWO was utilized to tackle OPF issues in the IEEE 30-bus and 118-bus systems, accounting for the fluctuation of renewable energy sources (RESs), such as wind and solar, in conjunction with traditional power network configurations. The method exhibits an optimal balance between exploration and exploitation, successfully minimizing fuel costs, power loss, voltage variation, and emissions, even in the presence of intricate non-convex and non-smooth optimization functions. A comparative examination with COA, GWO, and other modern metaheuristics demonstrates the advantage of COGWO in attaining high-quality global solutions characterized by improved solution stability and convergence speed. When it comes to optimizing power systems on a grand scale, COGWO is an attractive solution due to its computational efficiency, flexibility, and resilience.

• Keywords
• COGWO, Cuckoo optimization algorithm, Engineering optimization, Grey Wolf Optimizer, Multi-objective OPF, Renewable energy sources (RESs).,
• Publication type
• Journal Article MeSH

In this article, an improved variant of the cuckoo search (CS) algorithm named Coevolutionary Host-Parasite (CHP) is used for maximizing the metal removal rate in a turning process. The spindle speed, feed rate and depth of cut are considered as the independent parameters that describe the metal removal rate during the turning operation. A data-driven second-order polynomial regression approach is used for this purpose. The training dataset is designed using an L16 orthogonal array. The CHP algorithm is effective in quickly locating the global optima. Furthermore, CHP is seen to be sufficiently robust in the sense that it is able to identify the optima on independent reruns. The CHP predicted optimal solution presents ±10% deviations in the optimal process parameters, which shows the robustness of the optimal solution.

• Keywords
• cuckoo search, material removal rate (MRR), optimization, regression analysis,
• Publication type
• Journal Article MeSH

The amount of internet traffic generated during mass public events is significantly growing in a way that requires methods to increase the overall performance of the wireless network service. Recently, legacy methods in form of mobile cell sites, frequently called cells on wheels, were used. However, modern technologies are allowing the use of unmanned aerial vehicles (UAV) as a platform for network service extension instead of ground-based techniques. This results in the development of flying base stations (FBS) where the number of deployed FBSs depends on the demanded network capacity and specific user requirements. Large-scale events, such as outdoor music festivals or sporting competitions, requiring deployment of more than one FBS need a method to optimally distribute these aerial vehicles to achieve high capacity and minimize the cost. In this paper, we present a mathematical model for FBS deployment in large-scale scenarios. The model is based on a location set covering problem and the goal is to minimize the number of FBSs by finding their optimal locations. It is restricted by users' throughput requirements and FBSs' available throughput, also, all users that require connectivity must be served. Two meta-heuristic algorithms (cuckoo search and differential evolution) were implemented and verified on a real example of a music festival scenario. The results show that both algorithms are capable of finding a solution. The major difference is in the performance where differential evolution solves the problem six to eight times faster, thus it is more suitable for repetitive calculation. The obtained results can be used in commercial scenarios similar to the one used in this paper where providing sufficient connectivity is crucial for good user experience. The designed algorithms will serve for the network infrastructure design and for assessing the costs and feasibility of the use-case.

• Keywords
• 5G, FBS, UAV base station, flying base station, location covering problem, location optimization, network coverage capacity, on-demand,
• MeSH
• Algorithms * MeSH
• Models, Theoretical * MeSH
• Publication type
• Journal Article MeSH

The sine-cosine algorithm (SCA) is a new population-based meta-heuristic algorithm. In addition to exploiting sine and cosine functions to perform local and global searches (hence the name sine-cosine), the SCA introduces several random and adaptive parameters to facilitate the search process. Although it shows promising results, the search process of the SCA is vulnerable to local minima/maxima due to the adoption of a fixed switch probability and the bounded magnitude of the sine and cosine functions (from -1 to 1). In this paper, we propose a new hybrid Q-learning sine-cosine- based strategy, called the Q-learning sine-cosine algorithm (QLSCA). Within the QLSCA, we eliminate the switching probability. Instead, we rely on the Q-learning algorithm (based on the penalty and reward mechanism) to dynamically identify the best operation during runtime. Additionally, we integrate two new operations (Lévy flight motion and crossover) into the QLSCA to facilitate jumping out of local minima/maxima and enhance the solution diversity. To assess its performance, we adopt the QLSCA for the combinatorial test suite minimization problem. Experimental results reveal that the QLSCA is statistically superior with regard to test suite size reduction compared to recent state-of-the-art strategies, including the original SCA, the particle swarm test generator (PSTG), adaptive particle swarm optimization (APSO) and the cuckoo search strategy (CS) at the 95% confidence level. However, concerning the comparison with discrete particle swarm optimization (DPSO), there is no significant difference in performance at the 95% confidence level. On a positive note, the QLSCA statistically outperforms the DPSO in certain configurations at the 90% confidence level.

• MeSH
• Algorithms * MeSH
• Heuristics * MeSH
• Computer Simulation MeSH
• Publication type
• Journal Article MeSH
• Research Support, Non-U.S. Gov't MeSH