A metaheuristic to solve the transmission expansion planning

dc.creatorRomero, R
dc.creatorRider, MJ
dc.creatorSilva, ID
dc.date2007
dc.dateNOV
dc.date2014-11-13T15:16:06Z
dc.date2015-11-26T17:10:05Z
dc.date2014-11-13T15:16:06Z
dc.date2015-11-26T17:10:05Z
dc.date.accessioned2018-03-28T23:58:41Z
dc.date.available2018-03-28T23:58:41Z
dc.identifierIeee Transactions On Power Systems. Ieee-inst Electrical Electronics Engineers Inc, v. 22, n. 4, n. 2289, n. 2291, 2007.
dc.identifier0885-8950
dc.identifierWOS:000250559200098
dc.identifier10.1109/TPWRS.2007.907592
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/76044
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/76044
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/76044
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1280776
dc.descriptionIn 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.description22
dc.description4
dc.description2289
dc.description2291
dc.languageen
dc.publisherIeee-inst Electrical Electronics Engineers Inc
dc.publisherPiscataway
dc.publisherEUA
dc.relationIeee Transactions On Power Systems
dc.relationIEEE Trans. Power Syst.
dc.rightsfechado
dc.rightshttp://www.ieee.org/publications_standards/publications/rights/rights_policies.html
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