Abstract

The article presents an adaptive genetic algorithm developed by the authors, which makes it possible to optimize the topology of a power network with distributed generation. The optimization was based on bioinspired methods. The objects of the study were a 15-node circuit of a power net-work with photovoltaic stations and a 14-node IEEE augmented circuit with distributed generation sources (three wind farms and two photovoltaic plants). The simulation of the modes of electric power systems was performed using the Pandapower library for the Python programming language, which is in the public domain. Three types of electric load of consumers were considered, reflecting the natures of electricity consumption in the nodes of real electric power systems, the results of numerical studies were presented. The proposed genetic algorithm used two different functions of interbreeding, the function of mutation, selection of the best individuals and mass mutation (complete population renewal). At the end of each iteration of the algorithm operation, statistical dependencies were de-rived that characterized its work: the best (minimal losses) and average adaptability in the population, a list of the best individuals throughout all iterations, etc. The verification was carried out in comparison with the results obtained by a complete search of possible radial configurations of the system, and it showed that the developed genetic algorithm had fast convergence, high accuracy and was able to work correctly with different configurations of electrical circuits, generation and load structures. The algorithm can be used in conjunction with renewable energy sources generation forecasting systems for the day ahead when planning the operating modes of power units in order to minimize the costs of covering electricity losses and improve the quality of electricity supplied.

Full Text
Paper version not known

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 call

Disclaimer: 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.