| dc.contributor | Universidade Estadual Paulista (UNESP) | |
| dc.creator | Romero, Ruben | |
| dc.creator | Rider, M. J. | |
| dc.creator | Silva, Irenio de J. | |
| dc.date | 2014-05-20T15:19:51Z | |
| dc.date | 2016-10-25T17:52:46Z | |
| dc.date | 2014-05-20T15:19:51Z | |
| dc.date | 2016-10-25T17:52:46Z | |
| dc.date | 2007-11-01 | |
| dc.date.accessioned | 2017-04-05T23:22:21Z | |
| dc.date.available | 2017-04-05T23:22:21Z | |
| dc.identifier | IEEE Transactions on Power Systems. Piscataway: IEEE-Inst Electrical Electronics Engineers Inc., v. 22, n. 4, p. 2289-2291, 2007. | |
| dc.identifier | 0885-8950 | |
| dc.identifier | http://hdl.handle.net/11449/31230 | |
| dc.identifier | http://acervodigital.unesp.br/handle/11449/31230 | |
| dc.identifier | 10.1109/TPWRS.2007.907592 | |
| dc.identifier | WOS:000250559200098 | |
| dc.identifier | http://dx.doi.org/10.1109/TPWRS.2007.907592 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/875819 | |
| dc.description | In 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.language | eng | |
| dc.publisher | Institute of Electrical and Electronics Engineers (IEEE) | |
| dc.relation | IEEE Transactions on Power Systems | |
| dc.rights | info:eu-repo/semantics/closedAccess | |
| dc.subject | combinatorial optimization | |
| dc.subject | genetic algorithm | |
| dc.subject | metaheuristics | |
| dc.subject | transmission expansion planning | |
| dc.title | A metaheuristic to solve the transmission expansion planning | |
| dc.type | Otro | |
