dc.contributorMato Grosso State University
dc.contributorUniversidade Estadual Paulista (UNESP)
dc.date.accessioned2022-04-29T09:23:53Z
dc.date.accessioned2022-12-20T03:25:33Z
dc.date.available2022-04-29T09:23:53Z
dc.date.available2022-12-20T03:25:33Z
dc.date.created2022-04-29T09:23:53Z
dc.date.issued2013-12-01
dc.identifierIEEE Power and Energy Society General Meeting.
dc.identifier1944-9925
dc.identifier1944-9933
dc.identifierhttp://hdl.handle.net/11449/232223
dc.identifier10.1109/PESMG.2013.6672615
dc.identifier2-s2.0-84893174914
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/5412358
dc.description.abstractA specialized genetic algorithm with a adaptation of Chu-Beasley algorithm is presented in this paper to solve the electrical distribution distribution system expansion planning (DSP) problem modeled by a mixed integer nonlinear programming problem. The specialized genetic algorithm proposed in this paper starting from a initial population where all elements have a radial topology found using a heuristic algorithm and after the selection and mutation operations must also go through a local improvement in order to make the proposed solution in a feasible solution, if necessary, with respect to operational constraints. The DSP problem presented in this paper consider the circuit construction/recondutoring for different types of conductors and the substation construct/reinforcement. To evaluate the quality of the proposed methodology were used three different test systems found in the literature, 23, 54 and 136 buses systems. © 2013 IEEE.
dc.languageeng
dc.relationIEEE Power and Energy Society General Meeting
dc.sourceScopus
dc.subjectDistribution network planning
dc.subjectgenetic algorithm
dc.subjectmixed integer nonlinear programming
dc.subjectpower systems optimization
dc.titleSpecialized genetic algorithm to solve the electrical distribution system expansion planning
dc.typeActas de congresos


Este ítem pertenece a la siguiente institución