Coarse Grained Parallel Quantum Genetic Algorithm for Reconfiguration of Electric Power Networks

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, a Coarse Grained Parallel Quantum Genetic Algorithm (CGPQGA) is proposed to solve the network reconfiguration problem in distribution networks with the objective of reducing network losses, balancing load and improving the quality of voltage in the system. Based on the parallel evolutionary concept and the insights of quantum theory, we simulate a model of parallel quantum computation. In this frame, there are some demes (sub-populations) and some universes (groups of populations), which are structured in super star-shaped topologies. A new migration scheme based on penetration theory is developed to control both the migration rate and direction adaptively between demes and a coarse grained quantum crossover strategy is devised among universes. The proposed approach is tested on 33-bus distribution networks with the aim of minimizing the losses of reconfigured network, where the choice of the switches to be opened is based on the calculation of voltages at the system buses, real and reactive power flow through lines, real power losses and voltage deviations, using distribution load flow (DLF) program. Simulation results prove the effectiveness of the proposed methodology in solving the current challenges in this phase.

Cite

CITATION STYLE

APA

Hieba, A. A., Abbasy, N. H., & Abdelaziz, A. R. (2020). Coarse Grained Parallel Quantum Genetic Algorithm for Reconfiguration of Electric Power Networks. In Advances in Intelligent Systems and Computing (Vol. 923, pp. 219–237). Springer Verlag. https://doi.org/10.1007/978-3-030-14347-3_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free