Doctoral Thesis
DOI
10.11606/T.55.2018.tde-17102018-085628
Document
Author
Full name
Karla Barbosa de Freitas Spatti
E-mail
Institute/School/College
Knowledge Area
Date of Defense
Published
São Carlos, 2018
Supervisor
Committee
Toledo, Cláudio Fabiano Motta (President)
Branco, Hermes Manoel Galvão Castelo
Garcia, Vinicius Jacques
Mantovani, José Roberto Sanches
Santos, Maristela Oliveira dos
Title in Portuguese
Modelos matemáticos e heurísticas baseadas em técnicas de programação matemática para o problema de minimização de perdas e reconfiguração de redes elétricas
Keywords in Portuguese
Heurística fix-and-optimize
Minimização de perdas
Modelos matemáticos
Otimização
Reconfiguração de redes elétricas
Abstract in Portuguese
Title in English
Mathematical models and heuristic based on mathematical programming techniques for the problem of minimization of losses and reconfiguration of electrical networks
Keywords in English
Fix-and-optimize heuristic
Mathematical methods
Optimization
Power distribuition reconfiguration
Power loss minimization
Abstract in English
A reconfiguration of electricity distribution networks consists in altering a topology of the networks by means of key maneuvers in the primary circuits. It is a problem of combinatorial optimization, where the objectives are a minimization of active losses and/or number of maneuvers performed, taking into account constraints such as fault isolation, load balance between feeders and improvement of voltage levels. As difficulties in modeling and in the exact resolution of problems involving a reconfiguration of distribution networks come from the size of the real systems, represented by a large number of switches and feeders, and also by the combinatorial nature of the problem. To address these issues, several models and computational techniques have been developed, in particular heuristics of improvement that through a feasible solution, improves results by reducing the search space, until finding a new solution with better objective function. In this sense, in this thesis it is proposed of two mathematical formulations describing new constraints in order to improve a description of the problem. A first, simpler formulation considers only a active part of the instances, in the second a complete model is described optimizing some restrictions of the first model and also considering the reactive part of the instances. Two heuristics are also first adapted to the network reconfiguration problem. The Fix-and-Optmize enhancement heuristic is configured in two different ways, determining its key parameters through a sensitivity analysis. The results of the two proposed models and also of the heuristics adapted for 13 reference systems are described and compared with other methods of the literature. To verify the efficiency and robustness of the developed methods and heuristics, replications are proposed for two reference systems, 9 replications of the 72 bus system and 4 replications of the 10560 bus system. Its results as well as the performance of the methods are described and evaluated.

WARNING - Viewing this document is conditioned on your acceptance of the following terms of use:
This document is only for private use for research and teaching activities. Reproduction for commercial use is forbidden. This rights cover the whole data about this document as well as its contents. Any uses or copies of this document in whole or in part must include the author's name.
Publishing Date
2018-10-17

WARNING: Learn what derived works are clicking here.
All rights of the thesis/dissertation are from the authors
CeTI-SC/STI