By Topic

Bardsir network reconfiguration using Graph Theory-based Binary Genetic Algorithm to reduce loss and improve voltage profile

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Esmaeilian, H.R. ; Dept. of Electr. & Comput. Eng., Kerman Grad. Univ. of Technol., Kerman, Iran ; Jashfar, S. ; Fadaeinedjad, R. ; Esmaeili, S.
more authors

The purpose of optimal reconfiguration of a distribution network is a matter of finding the best topology of the network to achieve the considered goals. This paper presents an algorithm for optimal reconfiguration of distribution networks using Binary Genetic Algorithm (BGA) based on Graph Theory (GT) as a multi-objective optimization problem. The objective function considers the real power losses, and the network voltage deviation index. Also, lines and transformers loading limits are considered as constraints in the optimization problem. To assess the capabilities of the proposed approach, two networks are studied: the IEEE 33-bus distribution network as a small grid and Bardsir regional medium voltage distribution network as a large-scale grid. Simulation results show both voltage profile improvement and loss reduction compared to the situation before the reconfiguration. The algorithm is implemented in MATLAB software and then evaluated by DIgSILENT Power Facrory 14.0.515 software.

Published in:

Electrical Power Distribution Networks (EPDC), 2012 Proceedings of 17th Conference on

Date of Conference:

2-3 May 2012