Radial network reconfiguration using genetic algorithm based on the matroid theory

Author

Enacheanu, B. ; Raison, Bertrand ; Caire, Raphael ; Devaux, O. ; Bienia, W. ; HadjSaid, N.

fYear

2008

fDate

20-24 July 2008

Firstpage

1

Lastpage

1

Abstract

This paper deals with distribution network (DN) reconfiguration for loss minimization. To solve this combinatorial problem, a genetic algorithm (GA) is considered. In order to enhance its ability to explore the solution space, efficient genetic operators are developed. After a survey of the existing DN topology description methods, a theoretical approach based on the graph and matroid theories (graphic matroid in particular) is considered. These concepts are used in order to propose new intelligent and effective GA operators for efficient mutation and crossover well dedicated to the DN reconfiguration problem.

Keywords

distribution networks; genetic algorithms; graph theory; combinatorial problem; distribution network reconfiguration; distribution network topology; genetic algorithm; graph theory; graphic matroid; loss minimization; matroid theory; radial network reconfiguration; Genetic algorithms; Genetic mutations; Graphics; Network topology; Space exploration;

fLanguage

English

Publisher

ieee

Conference_Titel

Power and Energy Society General Meeting - Conversion and Delivery of Electrical Energy in the 21st Century, 2008 IEEE

Conference_Location

Pittsburgh, PA

ISSN

1932-5517

Print_ISBN

978-1-4244-1905-0

Electronic_ISBN

1932-5517

Type

conf

DOI

10.1109/PES.2008.4596321

Filename

4596321