| dc.contributor | Universidade Estadual Paulista (UNESP) | |
| dc.creator | Delgado, M. A. J. | |
| dc.creator | Pourakbari-Kasmaei, M. | |
| dc.creator | Rider, M. J. | |
| dc.creator | IEEE | |
| dc.date | 2015-03-18T15:56:37Z | |
| dc.date | 2016-10-25T20:35:51Z | |
| dc.date | 2015-03-18T15:56:37Z | |
| dc.date | 2016-10-25T20:35:51Z | |
| dc.date | 2013-01-01 | |
| dc.date.accessioned | 2017-04-06T07:19:51Z | |
| dc.date.available | 2017-04-06T07:19:51Z | |
| dc.identifier | 2013 13th International Conference On Environment And Electrical Engineering (eeeic). New York: Ieee, p. 234-238, 2013. | |
| dc.identifier | http://hdl.handle.net/11449/117642 | |
| dc.identifier | http://acervodigital.unesp.br/handle/11449/117642 | |
| dc.identifier | WOS:000345761400043 | |
| dc.identifier | http://ieeexplore.ieee.org/xpl/abstractAuthors.jsp?reload=true&arnumber=6737914 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/928289 | |
| dc.description | In this paper a novel Branch and Bound (B&B) algorithm to solve the transmission expansion planning which is a non-convex mixed integer nonlinear programming problem (MINLP) is presented. Based on defining the options of the separating variables and makes a search in breadth, we call this algorithm a B&BML algorithm. The proposed algorithm is implemented in AMPL and an open source Ipopt solver is used to solve the nonlinear programming (NLP) problems of all candidates in the B&B tree. Strategies have been developed to address the problem of non-linearity and non-convexity of the search region. The proposed algorithm is applied to the problem of long-term transmission expansion planning modeled as an MINLP problem. The proposed algorithm has carried out on five commonly used test systems such as Garver 6-Bus, IEEE 24-Bus, 46-Bus South Brazilian test systems, Bolivian 57-Bus, and Colombian 93-Bus. Results show that the proposed methodology not only can find the best known solution but it also yields a large reduction between 24% to 77.6% in the number of NLP problems regarding to the size of the systems. | |
| dc.language | eng | |
| dc.publisher | Ieee | |
| dc.relation | 2013 13th International Conference On Environment And Electrical Engineering (eeeic) | |
| dc.rights | info:eu-repo/semantics/closedAccess | |
| dc.subject | Branch and Bound algorithm | |
| dc.subject | nonlinear mixed integer programming | |
| dc.subject | transmission expansion planning | |
| dc.title | A Modified Branch and Bound Algorithm to Solve the Transmission Expansion Planning Problem | |
| dc.type | Otro | |
