Lavorato, MarinaRider, Marcos J.Garcia, Ariovaldo V.Romero, Rubén [UNESP]2014-05-272014-05-272009-12-012009 IEEE Power and Energy Society General Meeting, PES '09.http://hdl.handle.net/11449/71297An 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.engAMPLConstructive heuristic algorithmDistribution network planningKNITROMixed binary nonlinear programmingPower systems optimizationContinuous variablesDistribution networkNonlinear optimization solverNonlinear programming problemOptimization techniquesPower systemsRelaxed problemSensitivity indicesDistributed parameter networksDynamic programmingHeuristic algorithmsHeuristic methodsOptimizationSpacecraftSpin polarizationNonlinear programmingTrabalho apresentado em evento10.1109/PES.2009.5275860Acesso aberto2-s2.0-77649316832