Service Restoration in Power Distribution Systems using Hybrid Multi-Agent Approach

M. Abilkhassenov, A. Auketayeva, N. Berikkazin, Prashant Kumar Jamwal, H. S. V. S. Kumar Nunna

2018

Closed access Metadata (CSL-JSON)
DOI 10.1109/coconet.2018.8476884
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

This paper examines recent developments of service restoration in distribution systems (DS). Recent approaches and challenges for service restoration are compared and analyzed. Service restoration is a multi-constraint, multi-objective, combinatorial, non-linear optimization problem. Its main aim is to maximize the number of priority loads restored, while minimizing the number of switching operations, within the shortest time interval. This paper introduces Hybrid Multi-Agent System Approach for service restoration, which uses Distributed Generators (DG) and Electric Vehicles (EVs). EVs are basically batteries, which are charged at low-load conditions and transmit required amount of energy at peak-load conditions back to the grid. Before applying this system in real cases, optimal positions of DGs must be found. In order to do so OpenDSS Distribution network simulator was used for IEEE 123 and 30 Bus System. After that, R&M algorithm was developed and implemented under IEEE 30 Bus System. The main goal of this algorithm is to determine the most optimal island ranges according to the given objective functions and constraints. Proposed R&M algorithm demonstrated quite promising results as it fulfill all preset requirements.