Skip to Main Content
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.
Date of Conference: 20-24 July 2008