Branch and bound algorithm for transmission network expansion planning using DC model

Detalhes bibliográficos
Autor(a) principal: Rider, Marcos J.
Data de Publicação: 2007
Outros Autores: Garcia, Ariovaldo V., Romero, Rubén [UNESP]
Tipo de documento: Artigo de conferência
Idioma: eng
Título da fonte: Repositório Institucional da UNESP
Texto Completo: http://dx.doi.org/10.1109/PCT.2007.4538512
http://hdl.handle.net/11449/70027
Resumo: This paper presents an algorithm to solve the network transmission system expansion planning problem using the DC model which is a mixed non-linear integer programming problem. The major feature of this work is the use of a Branch-and-Bound (B&B) algorithm to directly solve mixed non-linear integer problems. An efficient interior point method is used to solve the non-linear programming problem at each node of the B&B tree. Tests with several known systems are presented to illustrate the performance of the proposed method. ©2007 IEEE.
id UNSP_9915d1cef77c086aad74aef345a3cc30
oai_identifier_str oai:repositorio.unesp.br:11449/70027
network_acronym_str UNSP
network_name_str Repositório Institucional da UNESP
repository_id_str 2946
spelling Branch and bound algorithm for transmission network expansion planning using DC modelBranch-and-bound algorithmDC modelHigher order interior point methodMixed integer nonlinear programmingPower transmission planningBoolean functionsComputer networksDynamic programmingElectric power transmissionElectric power transmission networksLinearizationMathematical programmingNonlinear programmingLinear programmingThis paper presents an algorithm to solve the network transmission system expansion planning problem using the DC model which is a mixed non-linear integer programming problem. The major feature of this work is the use of a Branch-and-Bound (B&B) algorithm to directly solve mixed non-linear integer problems. An efficient interior point method is used to solve the non-linear programming problem at each node of the B&B tree. Tests with several known systems are presented to illustrate the performance of the proposed method. ©2007 IEEE.IEEEDepartment of Electric Energy Systems State University of Campinas, Campinas - SPFaculty of Engineering of Ilha Solteira Paulista State University, Ilha Solteira - SPFaculty of Engineering of Ilha Solteira Paulista State University, Ilha Solteira - SPIEEEUniversidade Estadual de Campinas (UNICAMP)Universidade Estadual Paulista (Unesp)Rider, Marcos J.Garcia, Ariovaldo V.Romero, Rubén [UNESP]2014-05-27T11:22:39Z2014-05-27T11:22:39Z2007-12-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObject1350-1355http://dx.doi.org/10.1109/PCT.2007.45385122007 IEEE Lausanne POWERTECH, Proceedings, p. 1350-1355.http://hdl.handle.net/11449/7002710.1109/PCT.2007.45385122-s2.0-50849145134Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPeng2007 IEEE Lausanne POWERTECH, Proceedingsinfo:eu-repo/semantics/openAccess2024-07-04T19:11:38Zoai:repositorio.unesp.br:11449/70027Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestrepositoriounesp@unesp.bropendoar:29462024-07-04T19:11:38Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false
dc.title.none.fl_str_mv Branch and bound algorithm for transmission network expansion planning using DC model
title Branch and bound algorithm for transmission network expansion planning using DC model
spellingShingle Branch and bound algorithm for transmission network expansion planning using DC model
Rider, Marcos J.
Branch-and-bound algorithm
DC model
Higher order interior point method
Mixed integer nonlinear programming
Power transmission planning
Boolean functions
Computer networks
Dynamic programming
Electric power transmission
Electric power transmission networks
Linearization
Mathematical programming
Nonlinear programming
Linear programming
title_short Branch and bound algorithm for transmission network expansion planning using DC model
title_full Branch and bound algorithm for transmission network expansion planning using DC model
title_fullStr Branch and bound algorithm for transmission network expansion planning using DC model
title_full_unstemmed Branch and bound algorithm for transmission network expansion planning using DC model
title_sort Branch and bound algorithm for transmission network expansion planning using DC model
author Rider, Marcos J.
author_facet Rider, Marcos J.
Garcia, Ariovaldo V.
Romero, Rubén [UNESP]
author_role author
author2 Garcia, Ariovaldo V.
Romero, Rubén [UNESP]
author2_role author
author
dc.contributor.none.fl_str_mv IEEE
Universidade Estadual de Campinas (UNICAMP)
Universidade Estadual Paulista (Unesp)
dc.contributor.author.fl_str_mv Rider, Marcos J.
Garcia, Ariovaldo V.
Romero, Rubén [UNESP]
dc.subject.por.fl_str_mv Branch-and-bound algorithm
DC model
Higher order interior point method
Mixed integer nonlinear programming
Power transmission planning
Boolean functions
Computer networks
Dynamic programming
Electric power transmission
Electric power transmission networks
Linearization
Mathematical programming
Nonlinear programming
Linear programming
topic Branch-and-bound algorithm
DC model
Higher order interior point method
Mixed integer nonlinear programming
Power transmission planning
Boolean functions
Computer networks
Dynamic programming
Electric power transmission
Electric power transmission networks
Linearization
Mathematical programming
Nonlinear programming
Linear programming
description This paper presents an algorithm to solve the network transmission system expansion planning problem using the DC model which is a mixed non-linear integer programming problem. The major feature of this work is the use of a Branch-and-Bound (B&B) algorithm to directly solve mixed non-linear integer problems. An efficient interior point method is used to solve the non-linear programming problem at each node of the B&B tree. Tests with several known systems are presented to illustrate the performance of the proposed method. ©2007 IEEE.
publishDate 2007
dc.date.none.fl_str_mv 2007-12-01
2014-05-27T11:22:39Z
2014-05-27T11:22:39Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/conferenceObject
format conferenceObject
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://dx.doi.org/10.1109/PCT.2007.4538512
2007 IEEE Lausanne POWERTECH, Proceedings, p. 1350-1355.
http://hdl.handle.net/11449/70027
10.1109/PCT.2007.4538512
2-s2.0-50849145134
url http://dx.doi.org/10.1109/PCT.2007.4538512
http://hdl.handle.net/11449/70027
identifier_str_mv 2007 IEEE Lausanne POWERTECH, Proceedings, p. 1350-1355.
10.1109/PCT.2007.4538512
2-s2.0-50849145134
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 2007 IEEE Lausanne POWERTECH, Proceedings
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv 1350-1355
dc.source.none.fl_str_mv Scopus
reponame:Repositório Institucional da UNESP
instname:Universidade Estadual Paulista (UNESP)
instacron:UNESP
instname_str Universidade Estadual Paulista (UNESP)
instacron_str UNESP
institution UNESP
reponame_str Repositório Institucional da UNESP
collection Repositório Institucional da UNESP
repository.name.fl_str_mv Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)
repository.mail.fl_str_mv repositoriounesp@unesp.br
_version_ 1826304008846835712

Registros relacionados