Distribution network planning using a constructive heuristic algorithm
Nenhuma Miniatura disponível
Data
2009-12-01
Autores
Lavorato, Marina
Rider, Marcos J.
Garcia, Ariovaldo V.
Romero, Rubén [UNESP]
Título da Revista
ISSN da Revista
Título de Volume
Editor
Resumo
An optimization technique to solve distribution network planning (DNP) problem is presented. This is a very complex mixed binary nonlinear programming problem. A constructive heuristic algorithm (CHA) aimed at obtaining an excellent quality solution for this problem is presented. In each step of the CHA, a sensitivity index is used to add a circuit or a substation to the distribution network. This sensitivity index is obtained solving the DNP problem considering the numbers of circuits and substations to be added as continuous variables (relaxed problem). The relaxed problem is a large and complex nonlinear programming and was solved through an efficient nonlinear optimization solver. A local improvement phase and a branching technique were implemented in the CHA. Results of two tests using a distribution network are presented in the paper in order to show the ability of the proposed algorithm. ©2009 IEEE.
Descrição
Palavras-chave
AMPL, Constructive heuristic algorithm, Distribution network planning, KNITRO, Mixed binary nonlinear programming, Power systems optimization, Continuous variables, Distribution network, Nonlinear optimization solver, Nonlinear programming problem, Optimization techniques, Power systems, Relaxed problem, Sensitivity indices, Distributed parameter networks, Dynamic programming, Heuristic algorithms, Heuristic methods, Optimization, Spacecraft, Spin polarization, Nonlinear programming
Como citar
2009 IEEE Power and Energy Society General Meeting, PES '09.