Utilize este identificador para citar ou criar um link para este item:
http://acervodigital.unesp.br/handle/11449/9826Registro de metadados completo
| Campo DC | Valor | Idioma |
|---|---|---|
| dc.contributor.author | Vinasco, Guillermo | - |
| dc.contributor.author | Rider, Marcos J. | - |
| dc.contributor.author | Romero, Ruben | - |
| dc.date.accessioned | 2014-05-20T13:29:12Z | - |
| dc.date.accessioned | 2016-10-25T16:48:38Z | - |
| dc.date.available | 2014-05-20T13:29:12Z | - |
| dc.date.available | 2016-10-25T16:48:38Z | - |
| dc.date.issued | 2011-11-01 | - |
| dc.identifier | http://dx.doi.org/10.1109/TPWRS.2011.2126291 | - |
| dc.identifier.citation | IEEE Transactions on Power Systems. Piscataway: IEEE-Inst Electrical Electronics Engineers Inc, v. 26, n. 4, p. 2574-2576, 2011. | - |
| dc.identifier.issn | 0885-8950 | - |
| dc.identifier.uri | http://hdl.handle.net/11449/9826 | - |
| dc.identifier.uri | http://acervodigital.unesp.br/handle/11449/9826 | - |
| dc.description.abstract | In 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. | en |
| dc.description.sponsorship | Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) | - |
| dc.description.sponsorship | Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) | - |
| dc.format.extent | 2574-2576 | - |
| dc.language.iso | eng | - |
| dc.publisher | Institute of Electrical and Electronics Engineers (IEEE) | - |
| dc.source | Web of Science | - |
| dc.subject | Combinatorial optimization | en |
| dc.subject | mixed binary linear programming problem | en |
| dc.subject | multistage transmission expansion planning | en |
| dc.title | A Strategy to Solve the Multistage Transmission Expansion Planning Problem | en |
| dc.type | outro | - |
| dc.contributor.institution | Univ Antioquia & Interconex Elect SA ISA | - |
| dc.contributor.institution | Universidade Estadual Paulista (UNESP) | - |
| dc.description.affiliation | Univ Antioquia & Interconex Elect SA ISA, Programa Ingn Elect, Medellin, Colombia | - |
| dc.description.affiliation | UNESP, Dept Elect Engn, Fac Engn Ilha Solteira, Ilha Solteira, SP, Brazil | - |
| dc.description.affiliationUnesp | UNESP, Dept Elect Engn, Fac Engn Ilha Solteira, Ilha Solteira, SP, Brazil | - |
| dc.identifier.doi | 10.1109/TPWRS.2011.2126291 | - |
| dc.identifier.wos | WOS:000298784500089 | - |
| dc.rights.accessRights | Acesso restrito | - |
| dc.relation.ispartof | IEEE Transactions on Power Systems | - |
| Aparece nas coleções: | Artigos, TCCs, Teses e Dissertações da Unesp | |
Não há nenhum arquivo associado com este item.
Itens do Acervo digital da UNESP são protegidos por direitos autorais reservados a menos que seja expresso o contrário.