A Strategy to Solve the Multistage Transmission Expansion Planning Problem

dc.contributorUniv Antioquia & Interconex Elect SA ISA
dc.contributorUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2014-05-20T13:29:12Z
dc.date.accessioned2022-10-05T13:28:07Z
dc.date.available2014-05-20T13:29:12Z
dc.date.available2022-10-05T13:28:07Z
dc.date.created2014-05-20T13:29:12Z
dc.date.issued2011-11-01
dc.identifierIEEE Transactions on Power Systems. Piscataway: IEEE-Inst Electrical Electronics Engineers Inc, v. 26, n. 4, p. 2574-2576, 2011.
dc.identifier0885-8950
dc.identifierhttp://hdl.handle.net/11449/9826
dc.identifier10.1109/TPWRS.2011.2126291
dc.identifierWOS:000298784500089
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/3886096
dc.description.abstractIn this letter, a heuristic to reduce the combinatorial search space (CSS) of the multistage transmission expansion planning (MTEP) problem is presented. The aim is to solve the MTEP modeled like a mixed binary linear programming (MBLP) problem using a commercial solver with a low computational time. The heuristic uses the solution of several static transmission expansion planning problems to obtain the reduced CSS. Results using some test and real systems show that the use of the reduced CSS solves the MTEP problem with better solutions compared to other strategies in the literature.
dc.languageeng
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.relationIEEE Transactions on Power Systems
dc.relation5.255
dc.relation2,742
dc.rightsAcesso restrito
dc.sourceWeb of Science
dc.subjectCombinatorial optimization
dc.subjectmixed binary linear programming problem
dc.subjectmultistage transmission expansion planning
dc.titleA Strategy to Solve the Multistage Transmission Expansion Planning Problem
dc.typeArtigo


Este ítem pertenece a la siguiente institución