A metaheuristic to solve the transmission expansion planning

dc.contributorUniversidade Estadual Paulista (Unesp)
dc.contributorUniversidade Estadual de Campinas (UNICAMP)
dc.date.accessioned2014-05-20T15:19:51Z
dc.date.available2014-05-20T15:19:51Z
dc.date.created2014-05-20T15:19:51Z
dc.date.issued2007-11-01
dc.identifierIEEE Transactions on Power Systems. Piscataway: IEEE-Inst Electrical Electronics Engineers Inc., v. 22, n. 4, p. 2289-2291, 2007.
dc.identifier0885-8950
dc.identifierhttp://hdl.handle.net/11449/31230
dc.identifier10.1109/TPWRS.2007.907592
dc.identifierWOS:000250559200098
dc.description.abstractIn this letter, a genetic algorithm (GA) is applied to solve - the static and multistage transmission expansion planning (TEP) problem. The characteristics of the proposed GA to solve the TEP problem are presented. Results using some known systems show that the proposed GA solves a smaller number of linear programming problems in order to find the optimal solutions and obtains a better solution for the multistage TEP problem.
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.subjectgenetic algorithm
dc.subjectmetaheuristics
dc.subjecttransmission expansion planning
dc.titleA metaheuristic to solve the transmission expansion planning
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución