Constructive heuristic algorithm in branch-and-bound structure applied to transmission network expansion planning

dc.contributorUniversidade Estadual Paulista (Unesp)
dc.contributorUniversidade de São Paulo (USP)
dc.contributorUniv Estadual Oeste Parana
dc.date.accessioned2014-05-20T15:22:53Z
dc.date.accessioned2022-10-05T16:19:09Z
dc.date.available2014-05-20T15:22:53Z
dc.date.available2022-10-05T16:19:09Z
dc.date.created2014-05-20T15:22:53Z
dc.date.issued2007-03-01
dc.identifierIet Generation Transmission & Distribution. Hertford: Institution Engineering Technology-iet, v. 1, n. 2, p. 318-323, 2007.
dc.identifier1751-8687
dc.identifierhttp://hdl.handle.net/11449/33793
dc.identifier10.1049/iet-gtd:20060239
dc.identifierWOS:000246464500015
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/3906044
dc.description.abstractA constructive heuristic algorithm to solve the transmission system expansion planning problem is proposed with the aim of circumventing some critical problems of classical heuristic algorithms that employ relaxed mathematical models to calculate a sensitivity index that guides the circuit additions. The proposed heuristic algorithm is in a branch-and-bound algorithm structure, which can be used with any planning model, such as Transportation model, DC model, AC model or Hybrid models. Tests of the proposed algorithm are presented on real Brazilian systems.
dc.languageeng
dc.publisherInstitution Engineering Technology-iet
dc.relationIet Generation Transmission & Distribution
dc.relation2.618
dc.relation0,907
dc.rightsAcesso restrito
dc.sourceWeb of Science
dc.titleConstructive heuristic algorithm in branch-and-bound structure applied to transmission network expansion planning
dc.typeArtigo


Este ítem pertenece a la siguiente institución