Evolutionary approach to optimisation of the operation of electric power distribution networks

S Filipiak ,J C Stępień

doi:10.14569/ijacsa.2013.040602

Abstract

An idea of using a classifying system and co-evolutionary algorithm for operation support of electric power distribution systems operators has been presented in the paper. The method proposed by the author of the work is typified by the short time of designating the most rational post breakdown configurations in complex electric power Medium Voltage distribution network structures. It is the use by the classifying system working with the co-evolution algorithm that enables the effective creation of substitute scenarios for the Medium Voltage electric power distribution network. The method drawn up may be used in current systems managing the work of distribution networks to assist network operators in taking decisions concerning connection actions in supervised electric power systems.

Highlights

Distribution networks faults can cause power failure for many users, what can be a reason of major economical losses
The choice of the final solution variant depends upon the decision maker decider, who in this instance may be the operator managing the operation of the electric power Medium Voltage distribution network
This article describes the development of this type of calculation methods, simultaneously containing their own innovative solution proposals concerning the application of a classification system working with the co-evolutionary algorithm

Summary

Introduction

Distribution networks faults can cause power failure for many users, what can be a reason of major economical losses. Restoration attempts to supply an ample amount of power to nonfaulty out-of-service areas for as many customers as possible while safely operating the distribution system. Reconfiguration for restoration is a combinatorial problem involving searching an enormous space of solutions. The problems with integer variables are NP hard, meaning no known algorithm exists to solve these problems in polynomial time. Reconfiguration for restoration problem is both NP hard and NP and belongs to the class of NP complete problems. For such kind of problems, the solution time increases with an increase in the number of integer variables.

Objectives

Methods

Results

Conclusion