# Optimal Management of High-Voltage Line Congestions Using Power Source Redispatching
## 5 Conclusions  
One of the main technical problems resulting from the increasing number of RESs connected to the power grid is line overload and problems with maintaining the power balance. They are particularly troublesome in conditions favorable to high generation. The relatively large dispersion of RESs causes the occurrence of areas with high saturation of these sources in practice. The advantage of power generated in these areas contributes to its flows towards other areas. In emergency states, consisting of unforeseen line or transformer outages, other branches may be overloaded. The task of the network operator then consists of an appropriate response in order to eliminate the threat. The high-voltage network has a grid structure (closed). It is difficult in such a network to intuitively indicate those elements that have the greatest impact on the occurring overloads. Appropriate methods and algorithms that enable making the right decision become helpful in such a case. This article addresses this issue. It proposes a methodology that allows for eliminating branch overloads by redispatching source power. It will allow operators to manage the network more efficiently and make appropriate decisions more easily. The novelty of the proposed methodology consists of combining the method of tracking power flows with metaheuristic optimization, taking into account different methods of balancing power in the power system in emergency conditions. The method of tracking active power flows makes it possible to identify those sources that are most responsible for line overloads. Using metaheuristic optimization, it is possible to find the optimal distribution of power in the RES to eliminate overloads. In addition, different ways have been used to maintain the power balance in the system by varying the power generated at conventional power plants. This is performed to minimize the reduction of power in the RESs selected in advance in order to minimize the economic impact of this procedure (redispatch). From several calculation variants considered, the operator has the option of choosing the best one. The authors' future work will be focused on sensitivity analysis by using different correlation coefficients between the power generated in the RESs and the power flows in the lines. Another promising approach seems to be the use of operational procedures such as network reconfiguration. In fact, in order to make online power limiting decisions, it is necessary to shorten the time it takes to obtain the computational results. The disadvantage of metaheuristic optimization is the relatively long computational time. Therefore, in the future, the authors also intend to reach for methods based on artificial intelligence, e.g., machine learning. However, in order for the machine to be optimally selected, various cases must be analyzed. After considering many different cases and obtaining results from optimization, it will be possible to use them as training data for the machine. The optimization results will then be the input data for the machine. After training, it will be possible to say that the machine works optimally. It will be possible to use it online. The trained machine should provide a solution practically immediately, in real time. Each possible action, supported by its effectiveness, is worth attention, especially if it contributes to the effective elimination of threats. Conceptualization, P.P., A.B. and L.B. ; methodology, P.P., A.B., L.B., T.B. and B.M. ; software, P.P. and A.B. ; validation, P.P., A.B., L.B., T.B. and B.M. ; formal analysis, P.P. and A.B. ; investigation, P.P., A.B., L.B., T.B. and B.M. ; resources, P.P., A.B., L.B., T.B. and B.M. ; data curation, P.P., A.B., L.B., T.B. and B.M. ; writing--original draft preparation, P.P. and A.B. ; writing--review and editing, P.P., A.B., L.B., T.B. and B.M. ; visualization, P.P., A.B., T.B. and B.M. ; supervision, P.P. and L.B. ; project administration, P.P. ; funding acquisition, P.P. and A.B.