Search

A Virtual Power Plant (VPP) is a centralized energy system that manages, and coordinates distributed energy resources, integrating them into a unified entity. While the physical assets may be dispersed across various locations, the VPP integrates them into a virtual unified entity capable of responding to grid demands and market signals. This paper presents a tri-level hierarchical coordinated operational framework of VPP. Firstly, an Improved Pelican Optimization Algorithm (IPOA) is introduced to optimally schedule Distributed Energy Resources (DERs) within the VPP, resulting in a significant reduction in generation costs. Comparative analysis against conventional algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) demonstrates IPOA's superior performance, achieving an average reduction of 8.5% in generation costs across various case studies. The second stage focuses on securing the optimized generation data from rising cyber threats, employing the capabilities of machine learning, preferably, a convolutional autoencoder to learn the normal patterns of the optimized data to detect deviations from the optimized generation data to prevent suboptimal decisions. The model exhibits exceptional performance in detecting manipulated data, with a False Positive Rate (FPR) of 1.92% and a Detection Accuracy (DA) of 98.06%, outperforming traditional detection techniques. Lastly, the paper delves into the dynamic nature of the day ahead market that the VPP participates in. In responding to the grid by selling its optimized generated power via the day-ahead market, the VPP employs the Prophet model, another machine learning technique to forecast the spot market price for the day-ahead to mitigate the adverse effects of price volatility. By utilizing Prophet forecasts, the VPP achieves an average revenue increase of 15.3% compared to scenarios without price prediction, emphasizing the critical role of predictive analytics in optimizing economic gains. This tri-level coordinated approach adopted addresses key challenges in the energy sector, facilitating progress towards achieving universal access to clean and affordable energy. [ABSTRACT FROM AUTHOR]

Reservoir flood control scheduling is a challenging optimization task, particularly due to the complexity of various constraints. This paper proposes an innovative algorithm design approach to address this challenge. Combining the basic walrus optimization algorithm with the adaptive ε-constraint method and introducing the SPM chaotic mapping for population initialization, spiral search strategy, and local enhancement search strategy based on Cauchy mutation and reverse learning significantly enhances the algorithm's optimization performance. On this basis, innovate an adaptive approach ε A New Algorithm for Constraints and Multi Strategy Optimization Improvement (ε-IWOA). To validate the performance of the ε-IWOA algorithm, 24 constrained optimization test functions are used to test its optimization capabilities and effectiveness in solving constrained optimization problems. Experimental results demonstrate that the ε-IWOA algorithm exhibits excellent optimization ability and stable performance. Taking the Taolinkou Reservoir, Daheiting Reservoir, and Panjiakou Reservoir in the middle and lower reaches of the Luanhe River Basin as a case study, this paper applies the ε-IWOA algorithm to practical reservoir scheduling problems by constructing a three-reservoir flood control scheduling system with Luanxian as the control point. A comparative analysis is conducted with the ε-WOA, ε-DE and ε-PSO (particle swarm optimization) algorithms.The experimental results indicate that ε-IWOA algorithm performs the best in optimization, with the occupied flood control capacity of the three reservoirs reaching 89.32%, 90.02%, and 80.95%, respectively. The control points in Luan County can reduce the peak by 49%.This provides a practical and effective solution method for reservoir optimization scheduling models. This study offers new ideas and solutions for flood control optimization scheduling of reservoir groups, contributing to the optimization and development of reservoir scheduling work. [ABSTRACT FROM AUTHOR]

The shuffled frog leaping algorithm (SFLA) is a promising metaheuristic bionics algorithm, which has been designed by the shuffled complex evolution and the particle swarm optimization (PSO) framework. However, it is easily trapped into local optimum and has the low optimization accuracy when it is used to optimize complex engineering problems. To overcome the shortcomings, a novel modified shuffled frog leaping algorithm (MSFLA) with inertia weight is proposed in this paper. To extend the scope of the direction and length of the updated worst frog (vector) of the original SFLA, the inertia weight α was introduced and its meaning and range of the new parameters are fully explained. Then the convergence of the MSFLA is deeply analyzed and proved theoretically by a new dynamic equation formed by Z-transform. Finally, we have compared the solution of the 7 benchmark functions with the original SFLA, other improved SFLAs, genetic algorithm, PSO, artificial bee colony algorithm, and the grasshopper optimization algorithm with invasive weed optimization. The testing results showed that the modified algorithms can effectively improve the solution accuracy and convergence property, and exhibited an excellent ability of global optimization in high-dimensional space and complex function problems. [ABSTRACT FROM AUTHOR]

The shuffled frog leaping algorithm (SFLA) is a promising metaheuristic bionics algorithm, which has been designed by the shuffled complex evolution and the particle swarm optimization (PSO) framework. However, it is easily trapped into local optimum and has the low optimization accuracy when it is used to optimize complex engineering problems. To overcome the shortcomings, a novel modified shuffled frog leaping algorithm (MSFLA) with inertia weight is proposed in this paper. To extend the scope of the direction and length of the updated worst frog (vector) of the original SFLA, the inertia weight α was introduced and its meaning and range of the new parameters are fully explained. Then the convergence of the MSFLA is deeply analyzed and proved theoretically by a new dynamic equation formed by Z-transform. Finally, we have compared the solution of the 7 benchmark functions with the original SFLA, other improved SFLAs, genetic algorithm, PSO, artificial bee colony algorithm, and the grasshopper optimization algorithm with invasive weed optimization. The testing results showed that the modified algorithms can effectively improve the solution accuracy and convergence property, and exhibited an excellent ability of global optimization in high-dimensional space and complex function problems. [ABSTRACT FROM AUTHOR]

Path planning is one of the most critical issues in many related fields including UAVs. Many researchers have addressed this problem according to different conditions and limitations, but modelling the 3-D space and routing with an evolutional algorithm in such spaces is an open issue. So, in this paper, we first, introduce a method to grids the environment using geometrical shapes. This can reduce the random states of cell decomposition and increases the computational speed. We then propose an effective routing algorithm based on the butterfly optimization algorithm (BOA). It can simultaneously optimize multiple path planning objectives. It uses an objective function to compute the shortest path, based on obstacle avoidance and the UAV's operational power minimization. A novel concept, the intelligent throwing agent, used in this algorithm prevents getting stuck in local optima and increases the network coverage in path planning. The throwing agent prevents the collision of the UAV with the obstacles using geometrical techniques and contour lines. The simulation results show that BOA has the least and second-least cost in best-case and worst-case scenarios in comparison with ant colony and particle swarm. Its run time and the optimal value of the fitting function are also better than the two other algorithms. [ABSTRACT FROM AUTHOR]

The goal of the multi-objective optimization algorithm is to quickly and accurately find a set of trade-off solutions. This paper develops a clustering-based competitive multi-objective particle swarm optimizer using the enhanced grid for solving multi-objective optimization problems, named EGC-CMOPSO. The enhanced grid mechanism involved in EGC-CMOPSO is designed to locate superior Pareto optimal solutions. Subsequently, a hierarchical-based clustering is established on the grid for improving the accuracy rate of the grid selection. Due to the adaptive division of clustering centers, EGC-CMOPSO is applicable for solving MOPs with various Pareto front (PF) shapes. Particularly, the inferior solutions are discarded and the leading particles are identified by the comprehensive ranking of particles in each cluster. Finally, the selected leading particles compete against each other, and the winner guides the update of the current particle. The proposed EGC-CMOPSO and the eight latest multi-objective optimization algorithms are performed on 21 test problems. The experimental results validate that the proposed EGC-CMOPSO is capable of handling multi-objective optimization problems (MOPs) and obtaining superior performance on both convergence and diversity. [ABSTRACT FROM AUTHOR]

This paper suggests an optimal maximum power point tracking (MPPT) control scheme for a grid-connected photovoltaic (PV) system using the arithmetic optimization algorithm (AOA). The parameters of the proportional-integral (PI) controller-based incremental conductance (IC) MPPT are optimally selected using AOA. To accomplish this study, a 100-kW benchmark PV system connected to a medium distribution utility is constructed and analyzed employing MATLAB/SIMULINK. The optimization framework seeks to minimize four standard benchmark performance indices, then select the best of the best among them. To verify the efficacy of the recommended methodology, a comprehensive comparison is conducted between AOA-based PI-IC-MPPT, modified incremental conductance MPPT (MIC), grey wolf optimization (GWO), genetic algorithm (GA), and particle swarm optimization (PSO)-based MPPT. The proposed control approach has achieved a reduction of 61, 3, 4.5, and 26.9% in the rise time and a decrease of 94, 84.7, 86.6, and 79.3% in the settling time compared with MIC, GWO, GA, and PSO in extracting MPPT of the proposed system, respectively. [ABSTRACT FROM AUTHOR]