dc.contributorUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2014-05-27T11:27:25Z
dc.date.available2014-05-27T11:27:25Z
dc.date.created2014-05-27T11:27:25Z
dc.date.issued2012-12-11
dc.identifierIEEE Power and Energy Society General Meeting.
dc.identifier1944-9925
dc.identifier1944-9933
dc.identifierhttp://hdl.handle.net/11449/74060
dc.identifier10.1109/PESGM.2012.6345048
dc.identifierWOS:000312493703052
dc.identifier2-s2.0-84870600662
dc.description.abstractThis paper presents an efficient tabu search algorithm (TSA) to solve the problem of feeder reconfiguration of distribution systems. The main characteristics that make the proposed TSA particularly efficient are a) the way in which the neighborhood of the current solution was defined; b) the way in which the objective function value was estimated; and c) the reduction of the neighborhood using heuristic criteria. Four electrical systems, described in detail in the specialized literature, were used to test the proposed TSA. The result demonstrate that it is computationally very fast and finds the best solutions known in the specialized literature. © 2012 IEEE.
dc.languageeng
dc.relationIEEE Power and Energy Society General Meeting
dc.relation0,328
dc.rightsAcesso aberto
dc.sourceScopus
dc.subjectFeeder reconfiguration of distribution systems
dc.subjectmixed binary nonlinear programming
dc.subjecttabu search algorithm
dc.subjectDistribution systems
dc.subjectEfficient implementation
dc.subjectElectrical systems
dc.subjectFeeder reconfigurations
dc.subjectMixed binary nonlinear programming
dc.subjectObjective function values
dc.subjectTabu search algorithms
dc.subjectCurrent limiting reactors
dc.subjectLearning algorithms
dc.subjectTabu search
dc.subjectFeeding
dc.titleAn efficient implementation of tabu search in feeder reconfiguration of distribution systems
dc.typeActas de congresos


Este ítem pertenece a la siguiente institución