Pareto Optimal Reconfiguration of Power Distribution Systems Using a Genetic Algorithm Based on NSGA-II

Reconfiguration, by exchanging the functional links between the elements of the system, represents one of the most important measures which can improve the operational performance of a distribution system. The authors propose an original method, aiming at achieving such optimization through the reco...

Full description

Saved in:
Bibliographic Details
Published in:Energies (Basel) 2013-03, Vol.6 (3), p.1439-1455
Main Authors: Tomoiagă, Bogdan, Chindriş, Mircea, Sumper, Andreas, Sudria-Andreu, Antoni, Villafafila-Robles, Roberto
Format: Article
Language:English
Subjects:
Algorismes genètics
Energies
Genetic algorithms
Linear programming
Methods
multi-objective optimization
Optimization
Pareto optimality
power distribution systems
reconfiguration
Sistemes de distribució d'energia elèctrica
Àrees temàtiques de la UPC
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Reconfiguration, by exchanging the functional links between the elements of the system, represents one of the most important measures which can improve the operational performance of a distribution system. The authors propose an original method, aiming at achieving such optimization through the reconfiguration of distribution systems taking into account various criteria in a flexible and robust approach. The novelty of the method consists in: the criteria for optimization are evaluated on active power distribution systems (containing distributed generators connected directly to the main distribution system and microgrids operated in grid-connected mode); the original formulation (Pareto optimality) of the optimization problem and an original genetic algorithm (based on NSGA-II) to solve the problem in a non-prohibitive execution time. The comparative tests performed on test systems have demonstrated the accuracy and promptness of the proposed algorithm.
ISSN:1996-1073
1996-1073
DOI:10.3390/en6031439