Grey Wolf Optimizer for RES Capacity Factor Maximization at the Placement Planning Stage

At the current stage of the integration of renewable energy sources into the power systems of many countries, requirements for compliance with established technical characteristics are being applied to power generation. One such requirement is the installed capacity utilization factor, which is extremely important for optimally placing power facilities based on renewable energy sources and for the successful development of renewable energy. Efficient placement maximizes the installed capacity utilization factor of a power facility, increasing energy efficiency and the payback period. The installed capacity utilization factor depends on the assumed meteorological factors relating to geographical location and the technical characteristics of power generation. However, the installed capacity utilization factor cannot be accurately predicted, since it is necessary to know the volume of electricity produced by the power facility. A novel approach to the optimization of placement of renewable energy source power plants and their capacity factor forecasting was proposed in this article. This approach combines a machine learning forecasting algorithm (random forest regressor) with a metaheuristic optimization algorithm (grey wolf optimizer). Although the proposed approach assumes the use of only open-source data, the simulations show better results than commonly used algorithms, such as random search, particle swarm optimizer, and firefly algorithm.


Introduction
Growth in the share of renewable energy sources (RES) in the generation profile will only intensify over the next five years against the backdrop of global energy development trends and strategies. According to the International Energy Agency (IEA) [1], from 2022 to 2027, 2400 GW of RES are planned. This capacity is equal to the total commissioning of RES for 2001-2021. At the same time, China, the European Union, the USA, and India plan to make the largest contribution to the increase in installed capacity. According to IEA forecasts, the capacity of new RES installations will be 1071.7 GW for China, 343.9 GW for the European Union, 280.6 GW for the USA, 145.6 GW for India, and about 329.5 GW for other countries.
Wind power plants (WPP) and photovoltaic power plants (PV) firmly dominate among new installed generation sources. Since 2019, WPPs and PVs account for more than 62% of all commissioning of generating capacities in the world energy industry [2] and more than 90% of generation commissioned based on RES.
The ever-increasing commissioning of installed RES capacity is aimed at reducing the carbon footprint. Reducing the carbon footprint in energy and industry is associated with minimizing the impact of human activities on climate change and global warming.
• 0.14-for solar generation power plants; • 0.27-for wind generation power plants.
Power plants operating on the basis of solar and wind energy are not dispatchable, unlike thermal generation and hydro generation. For PVs and WPPs, it is only possible to limit output power. The generated power and electricity directly depend on climatic parameters and the availability of renewable resources in the territories where the power plants are located (the amount of solar radiation and wind speed). Renewable energy generation is a stochastic value, since the meteorological and climatic phenomena, on which it depends, are stochastic in nature [7,8].
Thus, when developing projects for commissioning new generating capacities with renewable energy sources, two main problems arise: • forecasting the generation and installed capacity utilization factor of power plants with RES; • choosing the optimal location for power plants with RES in order to maximize the installed capacity utilization factor.
The installed capacity utilization factor (CF) is a characteristic of the efficiency of renewable energy generation and is determined in accordance with the following expression: where W T is the amount of electricity produced at the generation plant with RES over time T; P inst is the installed RES capacity of a power plant; and T is the period of time under consideration. When using the classical expression (1) to determine the installed CF, it is assumed that the power plant is already operating or can undertake dispatchable power generation (when generation can be changed within a certain range in two directions). It is obvious that when calculating the RES installed capacity utilization factor, the value will stochastically change according to climatic and meteorological conditions and will take on different values depending on the considered time interval. In addition, the calculation of the RES installed capacity utilization factor with the above expression implies that the amount of electricity produced is known. That is, expression (1) can only be used for power plants already in operation.
Thus, determining the installed capacity utilization factor of generating power plants operating on the basis of RES requires forecasting. Several main approaches are used to forecast RES generation: • application of autoregressive models for forecasting over very short planning horizons (an hour or less ahead) [9][10][11][12][13][14]; • use of probability distributions to determine the parameters of solar radiation and wind speed, followed by taking into account the efficiency of installations, the slope of solar panels and the orientation of wind turbines [15][16][17][18][19]; • application of forecasting models based on machine learning algorithms for direct generation forecast [20][21][22][23][24][25][26].
The probability distributions used to determine RES generation contain shape and scale parameters, the correct selection of which determines the forecast accuracy: of the beta distribution; Γ is the gamma function.
These parameters vary depending on the geographical location of the territory under consideration, are empirical, and are contained in statistical reference books [27].
Today, the most convenient tools for forecasting renewable energy generation are forecasting models using machine learning algorithms. However, training such models requires large amounts of previously labeled data. Such data should contain the values of the features used for forecasting and the values of the target value for which a forecast is to be made. Therefore, after training, the model can take the values of the forecasting features and return the forecasting value of the target.
Modern metaheuristic methods are used in many fields to solve optimization tasks with multimodal and difficult-to-derive target functions [28][29][30]. In the power industry, these methods are applied to such problems as the optimization of the operating states of electrical motors [31], power loss reduction [32], configuration optimization of hybrid RES power plants [33], forecasting and equipment parameters estimation [34,35].
These approaches combine metaheuristics (such as dragonfly, grey wolves, best-worst, and group decision-making algorithms) to achieve better results and stability. Also, in these approaches, metaheuristics are used for tuning hyperparameters of machine learning forecasting models, in particular for wind speed forecasting.
Metaheuristic methods, rather than classical ones, provide good results in difficult cases, but the found solution could be nonstable.
The main idea of this research is to provide an approach for the forecasting and optimization of RES by combining metaheuristic methods with machine learning algorithms to achieve a high performance and stable results while using open-source data.
As far as the proposed approach assumes the use of open-source data, the process of data collection and its preparation is time-consuming. In that case, to achieve an adequate operation time, forecasting and optimization algorithms should provide the least possible number of series calculations. A small number of agents in the optimization algorithm allows the saving of time for computing but retains great performance in results. That outcome makes the proposed approach applicable in practical terms to real energy optimization problems. This paper's structure is organized into the following sections: Section 2 contains the problem statement and defines the methods used for forecasting RES CF and placement optimization, followed by a mathematical formulation; the obtained results of the proposed forecasting and optimization algorithms are illustrated in Section 3; discussion of the results and applicability of the proposed algorithm, as far as future plans placed for research, are placed in Section 4.

Capacity Factor Forecasting
In order to solve the problem of forecasting the RES installed capacity utilization factor, this study proposes forecasting models based on a random forest regressor. The models were trained on data concerning the operation of RES located in CIS countries, supplemented with average climate parameters over five years from the NASA database.
Given in Table 1 are fragments of the initial data for training models for predicting the installed capacity utilization factor for PVs and WPPs. In order to preserve the confidentiality of the geographic location of strategic energy infrastructure facilities, the values in the Latitude and Longitude columns are not given in this work. The data for training the forecasting model includes the following parameters: • P inst is the installed capacity of the RES generation power facility, MW; • SWDIFF is the diffuse (light energy scattered out of the direction of the sun) solar irradiance incident on a horizontal plane at the surface of the Earth under all sky conditions, kW/m 2 ; • SWDNI is the direct solar radiation incident on a horizontal plane on the Earth's surface, kW/m 2 ; • SWDWN is the total solar radiation incident on a horizontal plane on the Earth's surface, kW/m 2 ; • RH2M is the ratio of the actual partial pressure of water vapor to the partial pressure at saturation at a height of 2 m (relative humidity), %; • T2M is the average air temperature at a height of 2 m above the ground, • C; • SRFALB is the ratio of solar energy reflected by the Earth's surface to the total solar energy incident on the Earth's surface, p.u.; • WS10M, WS50M is the average annual wind speed at a height of 10 and 50 m above the ground, respectively, m/s;

•
Latitude is the value of geographic latitude characterizing the location of the power facility, deg; • Longitude is the value of geographic longitude characterizing the location of the power facility, deg; • CF is the installed capacity utilization factor of the power facility, p.u.
The dimensions of the initial data used to train forecasting models were 94 rows and 11 columns for WPPs and 141 rows, 7 columns for PVs. The data were divided into training and test sets in a 70/30 ratio. For forecasting the CF, the forecasting model parameters presented in Table 2 were used. Table 2. Forecast models hyperparameters.

Model Number of Estimators Maximum Features
Random forest 61 3

Number of Estimators Maximum Features
Random forest 141 4 The complexity of forecasting the RES CF is expressed, among other things, in the absence of a strong dependence on the features used, which is a consequence of the stochastic nature of the predicted parameter. The significance of the features for the models used in forecasting the RES CF is shown in Figure 1. In the case of forecasting the PV's CF, the relationship with average annual climatic parameters is stronger than in the case of forecasting the WPP's CF. However, the dependence of the RES CF on the facility's geographical location and its installed capacity is predominant.

RES Placement Optimization
Within the framework of this study, part of optimization is to find options for the optimal geographical location of RES in order to maximize the capacity factor. The objective function within the task's framework is the CF of a power plant. The CF is determined using the forecasting models described in the first part of this study.
In general, the optimization problem can be represented as follows:

RES Placement Optimization
Within the framework of this study, part of optimization is to find options for the optimal geographical location of RES in order to maximize the capacity factor. The objective function within the task's framework is the CF of a power plant. The CF is determined using the forecasting models described in the first part of this study.
In general, the optimization problem can be represented as follows: where X, Y are vectors of independent and dependent variables and g is restrictions.
Geographical coordinates (longitude and latitude), which determine the position of a power facility, are independent variables. The dependent variables include all the annual mean meteorological parameters used by the model to calculate the CF value.
The location of the power plant within the boundaries of the selected area (region, territory, republic, etc.) is used as a constraint for the problem being solved: where p is a point (the geographical location of the power plant) and A is the allowable area (the area within the boundaries of the selected territory). The form of the objective function (the dependence of CF on geographical coordinates) for WPPs and PVs is shown in Figures 2 and 3. The forecasting model is used to calculate the values of the target function (capacity 3D representation of the CF forecast using a random forest algorithm, where axis X and Y correspond to the geographical location of the area and the Z axis represents target function value).
framework of this study, the processing time for requests for a WPP was about seven seconds and about 15 s for a PV.
The lengthy process of obtaining the meteorological parameters necessary for optimization imposes limitations on the calculation time of the optimization algorithms used. Thus, an algorithm is required that does not require a large number of agents, has a fast convergence, and has a function for controlling the degree of stochasticity of agents.
Such an algorithm is the grey wolf optimizer (GWO), widely used to solve optimization problems [37][38][39][40][41]. The algorithm is based on a mathematical model of the behavior of grey wolves during hunting. There is a strict hierarchy according to which all wolves in a pack can be classified: • at the first step of the hierarchy is the alpha wolf; • the beta wolf is located on the second step of the hierarchy; • the third most important in the pack is the delta wolf; • the remaining individuals are equal and are called omega wolves.
During the hunt, the leader is the alpha wolf. In addition, beta and delta individuals are auxiliary landmarks. Wolves are positioned in such a way as to surround the prey. At the same time, the expected prey position of omega wolves is determined based on the location of the leading individuals (alpha, beta and delta). The mathematical model describing the hunting of the pack is as follows: where X is a vector describing the position of the agent (wolf); p X is a vector describing the position of the supposed optimum (prey); , A C are vectors of calculated coefficients; and t is the current calculation iteration.   At each iteration, the position of all agents is updated according to the position of the alpha, beta, and delta individuals: where i D is the correction vector and 1 X , 2 X , 3 X are vectors with the updated positions of all agents, according to the three best agents (α, β, γ).
where X is the resulting vector with the updated positions of all agents.
Coefficients A and C are determined as follows: where a is a coefficient decreasing linearly in the interval [2,0] according to the number of the current iteration, and 1 2 , r r are random values in the interval [0, 1].
The required number of agents for this algorithm is comparable to the size of a pack of grey wolves and ranges from 7 to 15. The small number of agents of the algorithm determines its applicability within the framework of this problem (the time of one iteration of the calculation is 1.75-3.75 min with the maximum number of agents).
A graphical interpretation of the principle of changing the position of agents is shown in Figure 4. For optimization, it is advisable to use heuristic algorithms based on the principles of swarm intelligence, since the form of the objective function is multi-extremal and does not have an analytical form.
The values of the dependent variables are determined with the NASA POWER API [36]. Upon request and specifying the geographical coordinates of a point, a data array containing a number of parameters is returned. This array is processed; as a result, the average annual parameters can be obtained. The duration of the processing of one API request depends on the number of parameters returned and the time interval. Within the framework of this study, the processing time for requests for a WPP was about seven seconds and about 15 s for a PV.
The lengthy process of obtaining the meteorological parameters necessary for optimization imposes limitations on the calculation time of the optimization algorithms used. Thus, an algorithm is required that does not require a large number of agents, has a fast convergence, and has a function for controlling the degree of stochasticity of agents.
Such an algorithm is the grey wolf optimizer (GWO), widely used to solve optimization problems [37][38][39][40][41]. The algorithm is based on a mathematical model of the behavior of grey wolves during hunting. There is a strict hierarchy according to which all wolves in a pack can be classified: • at the first step of the hierarchy is the alpha wolf; • the beta wolf is located on the second step of the hierarchy; • the third most important in the pack is the delta wolf; • the remaining individuals are equal and are called omega wolves.
During the hunt, the leader is the alpha wolf. In addition, beta and delta individuals are auxiliary landmarks. Wolves are positioned in such a way as to surround the prey. At the same time, the expected prey position of omega wolves is determined based on the location of the leading individuals (alpha, beta and delta). The mathematical model describing the hunting of the pack is as follows: where X is a vector describing the position of the agent (wolf); X p is a vector describing the position of the supposed optimum (prey); A, C are vectors of calculated coefficients; and t is the current calculation iteration.
At each iteration, the position of all agents is updated according to the position of the alpha, beta, and delta individuals: where D i is the correction vector and X 1 , X 2 , X 3 are vectors with the updated positions of all agents, according to the three best agents (α, β, γ).
where X is the resulting vector with the updated positions of all agents.
Coefficients A and C are determined as follows: where a is a coefficient decreasing linearly in the interval [2,0] according to the number of the current iteration, and r 1 , r 2 are random values in the interval [0, 1]. The required number of agents for this algorithm is comparable to the size of a pack of grey wolves and ranges from 7 to 15. The small number of agents of the algorithm determines its applicability within the framework of this problem (the time of one iteration of the calculation is 1.75-3.75 min with the maximum number of agents).
A graphical interpretation of the principle of changing the position of agents is shown in Figure 4.  In the classical GWO algorithm, the coefficients determine the movements of agents (wolves), while changing parameter a from 2 to 0 changes the optimization stage. In the interval when a is greater than 1, the system is in the search stage (agents are dispersed in order to cover the widest search area possible). When parameter a is less than 1, then the system goes into the hunting stage (all agents move towards the optimum found at the previous stage). In the classical GWO algorithm, the coefficients determine the movements of agents (wolves), while changing parameter a from 2 to 0 changes the optimization stage. In the interval when a is greater than 1, the system is in the search stage (agents are dispersed in order to cover the widest search area possible). When parameter a is less than 1, then the system goes into the hunting stage (all agents move towards the optimum found at the previous stage).
This approach works correctly when optimizing functions that depend on abstract numerical parameters. However, when calculating coefficients A and C according to expressions (9), within one iteration of the calculation, the agents' coordinates increment too much (a change in latitude or longitude by 1 degree corresponds to a change in the agents' position by approximately 110 km). This leads to their ejection outside the established optimization boundaries. In order to exclude the release of agents beyond the established boundaries, additional coefficients equal to 0.2 and 1.5, respectively, were selected to calculate the vectors of coefficients A and C.
The flow chart of the proposed algorithm is shown in Figure 5.  The block for checking the increase in the CF of agents, represented by a dashed line in Figure 6, allows for the creation of a "greedy" algorithm in which the position of agents changes only when the objective function changes towards the optimum. The positions of agents in the initial population are determined by a random choice of coordinates from a 10,000 × 10,000 grid obtained from a given optimization area. In the initial population, the roles of alpha, beta, and delta individuals are distributed depending on the CF value. The same thing happens at the end of each iteration.
The criterion for stopping the algorithm is the completion of a given number of iterations. This criterion is a standard stopping criterion for heuristic algorithms when optimizing a complex multi-extremal function. The criterion of the minimum increment of the objective function in this case is not used as a stopping criterion, since during the optimization process, agents may temporarily "get stuck" at the point of local optimum. However, after several iterations of the calculation, the next best solution, which can be prevented by stopping the algorithm according to the criterion of the minimum increment of the objective function, can be found.
The forecasting model is used to calculate the values of the target function (the capacity factor) for each agent during the optimization process. The location (latitude and longitude) of the agent, together with the meteorological parameters, are used as the features for the forecasting model, and the result of the forecasting model is the value of the target function for the considered agent. When agents' positions are updating, the target function values recalculate again according to the process described above.
The block for checking the increase in the CF of agents, represented by a dashed line in Figure 6, allows for the creation of a "greedy" algorithm in which the position of agents changes only when the objective function changes towards the optimum.

Capacity Factor Forecasting
When validating the models with the cross-validation method, the training sample was randomly divided into five parts. The metrics expressing the quality of the model forecast [42,43] for the validation and testing stages are presented in Tables 3 and 4. The predicted value (CF) has a range of change from 0 to 1 p.u. (or from 0 to 100 as a percentage). Therefore, metrics representing the model score in named units (MAE, MSE, etc.)

Capacity Factor Forecasting
When validating the models with the cross-validation method, the training sample was randomly divided into five parts. The metrics expressing the quality of the model forecast [42,43] for the validation and testing stages are presented in Tables 3 and 4. The predicted value (CF) has a range of change from 0 to 1 p.u. (or from 0 to 100 as a percentage). Therefore, metrics representing the model score in named units (MAE, MSE, etc.) were not used. Instead, metrics that express the model results as percentages (nMAE, explained variance) are provided. In addition, to evaluate the largest deviation of the forecast from the actual values, the values of the maximum error (Max_error) are given. A graphical representation of the results of predictive models on a test sample is shown in Figure 6. Table 3. Evaluation metrics of the capacity factor forecasting model for wind power plants. The average absolute normalized error (nMAE) is 23.7% for the forecast model of the CF of WPP and 5.13% for the forecast model of the CF of PV. The average level of the explained variance of stochastic processes is 90.75% and 60.1%, respectively, for WPPs and PVs. Based on the above metrics and graphical representation of the data, it can be concluded that the resulting models make a stable forecast with high accuracy. Thus, despite the use of open data and a small amount of initial data, such models can be used as part of solving the problem of optimizing the placement of RES power plants to calculate the values of the CF as the objective function.

RES Placement Optimization
In order to determine the influence of the agent CF comparison block on the algorithm results, the results of two versions of the algorithm were compared, greedy GWO and basic GWO. Table 5 shows the optimization results for two versions of the algorithm. The "Inside" indicator shows whether the found solution is within the established boundaries of the problem or not.
During optimization with the basic GWO algorithm, the final solution is often outside the considered boundaries; during optimization, the value of the objective function decreases (instead of the expected increase). As a result, it can be concluded that it does not make sense to use the basic GWO algorithm for this problem. On the contrary, the modified greedy GWO algorithm stably returns solutions that are within the established boundaries and allows for determining several local optima. On average, the CF maximization for the placement of power plants based on RES for the greedy GWO algorithm is 0.166 percentage points for wind farms. A comparison of the optimums found by the algorithm with a two-dimensional display of the objective function for WPPs and PVs is shown in Figures 7 and 8. Figures 7 and 8 show the location of the agents during the last iteration of the proposed algorithm with green or blue polygons, and the background of the map is the contour representation of the 3D target function shown in Figures 2 and 3.
A detailed illustration of all iterations of one algorithm calculation for a 15 MW wind farm is presented in Appendix A.
The comparison of the proposed GWO to other commonly used metaheuristic algorithms such as firefly optimization algorithm (FFO), particle swarm optimization algorithm (PSO) and basic random search is presented in Figure 9 and in Table 6. The convergence curves for considered algorithms are shown in Figure 10. A comparison of the optimums found by the algorithm with a two-dimensional display of the objective function for WPPs and PVs is shown in Figures 7 and 8. Figures 7 and  8 show the location of the agents during the last iteration of the proposed algorithm with green or blue polygons, and the background of the map is the contour representation of the 3D target function shown in Figures 2 and 3.
A detailed illustration of all iterations of one algorithm calculation for a 15 MW wind farm is presented in Appendix A.   The comparison of the proposed GWO to other commonly used metaheuristic algorithms such as firefly optimization algorithm (FFO), particle swarm optimization algorithm (PSO) and basic random search is presented in Figure 9 and in Table 6. The convergence curves for considered algorithms are shown in Figure 10.

Discussion
In this study, a system for the collection and processing of the meteorological data necessary for forecasting the RES CF was created. Regression models based on machine learning algorithms were also proposed to forecast the CF of RES. The proposed models were trained on open data on the operation of energy facilities and meteorological data. As a result, the models showed high accuracy in predicting the stochastic variable, explaining about 90% of the variance in the distribution of WPP CF and about 60% of the variance of PV CF.
The forecasting results for the RES CF were integrated into the modified GWO optimization algorithm as an objective function. The basic GWO algorithm has been modified and tuned to solve the problem of optimizing the placement of RES-based power plants in order to maximize their CF.
Basic GWO is not applicable for optimizing the placement of RES-based power plants in order to maximize their CF. This is due to overly large increments of agent coordinates, which leads to the release of the final solution outside the considered area. To use GWO to solve this type of problem, it is necessary to adjust additional coefficients for vectors and save the final solution within the considered area. The use of greedy GWO makes it possible to eliminate the loss of the area with a high CF identified during optimization.
Based on the results of greedy GWO presented, it can be concluded that the algorithm copes with the optimization problem by identifying areas with high CF values for both WPPs and PVs. The area of the optimal solution found by the algorithm for WPPs coincides with the area of the global optimum of the objective function in seven out of 10 cases, for PV in six out of 10. The remaining solutions (3/10 for WPPs and 4/10 for PVs) correspond to local optima.
It is worth noting that the hexagons depicted in Figures 7 and 8, as well as in Appendix A, represent an area of about 10 square kilometers (simulating the area covered by real power plants based on RES with a capacity of up to 30 MW), and the geometry of this area can be changed. Such a format for displaying the results makes it possible to evaluate the distribution of the CF over the power plant territory, taking into account its geometry.
During optimization, the algorithm not only determines the global optimum of the multi-extremal CF distribution function depending on geographical location but also

Discussion
In this study, a system for the collection and processing of the meteorological data necessary for forecasting the RES CF was created. Regression models based on machine learning algorithms were also proposed to forecast the CF of RES. The proposed models were trained on open data on the operation of energy facilities and meteorological data. As a result, the models showed high accuracy in predicting the stochastic variable, explaining about 90% of the variance in the distribution of WPP CF and about 60% of the variance of PV CF.
The forecasting results for the RES CF were integrated into the modified GWO optimization algorithm as an objective function. The basic GWO algorithm has been modified and tuned to solve the problem of optimizing the placement of RES-based power plants in order to maximize their CF.
Basic GWO is not applicable for optimizing the placement of RES-based power plants in order to maximize their CF. This is due to overly large increments of agent coordinates, which leads to the release of the final solution outside the considered area. To use GWO to solve this type of problem, it is necessary to adjust additional coefficients for vectors and save the final solution within the considered area. The use of greedy GWO makes it possible to eliminate the loss of the area with a high CF identified during optimization.
Based on the results of greedy GWO presented, it can be concluded that the algorithm copes with the optimization problem by identifying areas with high CF values for both WPPs and PVs. The area of the optimal solution found by the algorithm for WPPs coincides with the area of the global optimum of the objective function in seven out of 10 cases, for PV in six out of 10. The remaining solutions (3/10 for WPPs and 4/10 for PVs) correspond to local optima.
It is worth noting that the hexagons depicted in Figures 7 and 8, as well as in Appendix A, represent an area of about 10 square kilometers (simulating the area covered by real power plants based on RES with a capacity of up to 30 MW), and the geometry of this area can be changed. Such a format for displaying the results makes it possible to evaluate the distribution of the CF over the power plant territory, taking into account its geometry.
During optimization, the algorithm not only determines the global optimum of the multi-extremal CF distribution function depending on geographical location but also suggests several potential areas for locating power plants with a high CF. The figures in Appendix A demonstrate the alignment of agents along the latitudinally extended region with the highest CF values (more than 0.5 p.u.).
Comparison of the proposed GWO against commonly used metaheuristics (FFO, PSO) and random search shows that the random search approach does not apply for such optimization problems because of the narrow areas of the high target function values. FFO and GWO perform far more greatly with similar mean results (0.4 and 0.39) and spread of found solutions. However, the proposed approach against the others has the potential to reach the global optimum and areas near the global optimum. PSO has great stability in the results on one side, but the other found solutions lie farther from the global optimum against the proposed algorithm. The results of the evaluation and comparison of the proposed algorithm show that it is competitive against modern state-of-the-art optimization approaches applied to the considered problem. Thus, this system, which consists of two algorithms for forecasting the CF and optimizing the placement of power plants based on RES and trained on open data, can be used for practical application to the real power industry problems regarding both assessment of the energy potential of territories and the planning of the placement of real power facilities, in addition to the evaluation of efficiency and power production for the realization of green certificates. However, this system still cannot be implemented in real-time decision support systems because of time-consuming data processing.
Regarding the theoretical and educational fields, the proposed approach could be used as a methodology in R&D projects related to energy optimization and as the base for further improvements.
Future work in this field will be aimed at the reduction of open-source data processing time, searching for new data sources, and modifications of proposed algorithms using further comparative analysis and hybridization with other optimization methods.