Abstract
The problem of the optimal reactive power flow in transmission systems is addressed in this research from the point of view of combinatorial optimization. A discrete-continuous version of the Chu & Beasley genetic algorithm (CBGA) is proposed to model continuous variables such as voltage outputs in generators and reactive power injection in capacitor banks, as well as binary variables such as tap positions in transformers. The minimization of the total power losses is considered as the objective performance indicator. The main contribution in this research corresponds to the implementation of the CBGA in the DigSILENT Programming Language (DPL), which exploits the advantages of the power flow tool at a low computational effort. The solution of the optimal reactive power flow problem in power systems is a key task since the efficiency and secure operation of the whole electrical system depend on the adequate distribution of the reactive power in generators, transformers, shunt compensators, and transmission lines. To provide an efficient optimization tool for academics and power system operators, this paper selects the DigSILENT software, since this is widely used for power systems for industries and researchers. Numerical results in three IEEE test feeders composed of 6, 14, and 39 buses demonstrate the efficiency of the proposed CBGA in the DPL environment from DigSILENT to reduce the total grid power losses (between 21.17% to 37.62% of the benchmark case) considering four simulation scenarios regarding voltage regulation bounds and slack voltage outputs. In addition, the total processing times for the IEEE 6-, 14-, and 39-bus systems were 32.33 s, 49.45 s, and 138.88 s, which confirms the low computational effort of the optimization methods directly implemented in the DPL environment.
Highlights
Electric power systems in high-voltage levels are electrical networks with the responsibility of transporting large amounts of energy from generation plants to sub-transmission and distribution substations [1]
To demonstrate the effectiveness and robustness of the proposed Chu & Beasley genetic algorithm (CBGA) implemented in the DigSILENT Programming Language (DPL) environment from DigSILENT to resolve the optimal reactive power flow problem in transmission networks, we report in Table 15 the average processing times for all the IEEE bus systems
The optimal reactive power flow problem in transmission systems was addressed in this research from the point of view of the combinatorial optimization by implementing a CBGA in DPL environment from DigSILENT software
Summary
Electric power systems in high-voltage levels are electrical networks with the responsibility of transporting large amounts of energy from generation plants to sub-transmission and distribution substations [1]. The main contribution of this approach corresponds to the proposition of the a distributed gradient-based optimization algorithm to solve the Computers 2021, 10, 151 optimal reactive power flow problem considering dispersed distributed generation in distribution networks. The main advantage of the proposed optimization method corresponds to the usage of the well known power flow tools in the DigSILENT software [28] This software allows to model the complete power system as much as possible with synchronous machines, two- and three-winding transformers, capacitive and reactive compensators and models of complete line [29].
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
