Open AccessReconfiguration of distribution system through two minimum‐current neighbour‐chain updating methods
Author(s) -
Ferdavani Ali Khorasani,
Mohd Zin Abdullah Asuhaimi,
Khairuddin Azhar,
Naeini Marjan Mortazavi
Publication year - 2013
Publication title -
iet generation, transmission and distribution
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.92
H-Index - 110
eISSN - 1751-8695
pISSN - 1751-8687
DOI - 10.1049/iet-gtd.2012.0737
Subject(s) - control reconfiguration , computer science , heuristic , mathematical optimization , reduction (mathematics) , process (computing) , current (fluid) , neighbourhood (mathematics) , algorithm , topology (electrical circuits) , mathematics , engineering , embedded system , electrical engineering , mathematical analysis , geometry , operating system
This study presents a new two‐stage heuristic algorithm for loss‐reduction reconfiguration of radial electrical distribution system. In the first stage, which is a close‐all‐switch technique and based on successively opening the minimum‐current branches, the algorithm determines a feasible solution for the switch configuration. The second stage uses a neighbour‐chain updating process (NCUP), which periodically updates each open switch of the configuration with its best neighbourhood switches. Depending on applicability of the circular mechanism on NCUP, two methods are utilised. The results of applying the proposed methods on five standard hypothetical or practical test networks demonstrate their excellent performance in obtaining best‐known solutions in a systematic manner.