A modified Branch and Bound algorithm to solve the transmission expansion planning problem

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.contributorUniversidade Estadual Paulista (UNESP)-
Autor(es): dc.creatorDelgado, M. A.J.-
Autor(es): dc.creatorPourakbari-Kasmaei, M.-
Autor(es): dc.creatorRider, M. J.-
Data de aceite: dc.date.accessioned2025-08-21T17:46:49Z-
Data de disponibilização: dc.date.available2025-08-21T17:46:49Z-
Data de envio: dc.date.issued2022-04-29-
Data de envio: dc.date.issued2022-04-29-
Data de envio: dc.date.issued2013-12-01-
Fonte completa do material: dc.identifierhttp://dx.doi.org/10.1109/EEEIC-2.2013.6737914-
Fonte completa do material: dc.identifierhttp://hdl.handle.net/11449/227660-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/11449/227660-
Descrição: dc.descriptionIn 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. © 2013 IEEE.-
Descrição: dc.descriptionDepartment of Electrical and Electronic Engineering UNESP, Ilha Solteira-
Descrição: dc.descriptionDepartment of Electrical and Electronic Engineering UNESP, Ilha Solteira-
Formato: dc.format234-238-
Idioma: dc.languageen-
Relação: dc.relation2013 13th International Conference on Environment and Electrical Engineering, EEEIC 2013 - Conference Proceedings-
???dc.source???: dc.sourceScopus-
Palavras-chave: dc.subjectBranch and Bound algorithm-
Palavras-chave: dc.subjectNonlinear mixed integer programming-
Palavras-chave: dc.subjectTransmission expansion planning-
Título: dc.titleA modified Branch and Bound algorithm to solve the transmission expansion planning problem-
Tipo de arquivo: dc.typeaula digital-
Aparece nas coleções:Repositório Institucional - Unesp

Não existem arquivos associados a este item.