Derivation and generation of path-based valid inequalities for transmission expansion planning

Detalhes bibliográficos
Autor(a) principal: Skolfield, J. Kyle
Data de Publicação: 2022
Outros Autores: Escobar, Laura M. [UNESP], Escobedo, Adolfo R.
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Institucional da UNESP
Texto Completo: http://dx.doi.org/10.1007/s10479-022-04643-1
http://hdl.handle.net/11449/223646
Resumo: This paper seeks to solve the long-term transmission expansion planning problem in power systems more effectively by reducing the solution search space and the computational effort. The proposed methodology finds and adds cutting planes based on structural insights about bus angle differences along paths. Two lemmas and a theorem are proposed which formally establish the validity of these cutting planes onto the underlying mathematical formulations. These path-based bus angle difference constraints, which tighten the relaxed feasible region, are used in combination with branch-and-bound to find lower bounds on the optimal investment of the transmission expansion planning problem. This work also creates an algorithm that automates the process of finding and applying the most effective valid inequalities, resulting in significantly reduced testing and computational time. The algorithm is implemented in Python, using Gurobi to add constraints and solve the exact DCOPF-based transmission expansion problem. This paper uses two different-sized systems to illustrate the effectiveness of the proposed framework: the GOC 500-bus system and a modified Polish 2383-bus system.
id UNSP_07ae7a9dae0c12b4ce163b1e7dd692fd
oai_identifier_str oai:repositorio.unesp.br:11449/223646
network_acronym_str UNSP
network_name_str Repositório Institucional da UNESP
repository_id_str 2946
spelling Derivation and generation of path-based valid inequalities for transmission expansion planningMathematical modelingMixed-integer linear programmingOR in energyTransmission expansion planningValid inequalitiesThis paper seeks to solve the long-term transmission expansion planning problem in power systems more effectively by reducing the solution search space and the computational effort. The proposed methodology finds and adds cutting planes based on structural insights about bus angle differences along paths. Two lemmas and a theorem are proposed which formally establish the validity of these cutting planes onto the underlying mathematical formulations. These path-based bus angle difference constraints, which tighten the relaxed feasible region, are used in combination with branch-and-bound to find lower bounds on the optimal investment of the transmission expansion planning problem. This work also creates an algorithm that automates the process of finding and applying the most effective valid inequalities, resulting in significantly reduced testing and computational time. The algorithm is implemented in Python, using Gurobi to add constraints and solve the exact DCOPF-based transmission expansion problem. This paper uses two different-sized systems to illustrate the effectiveness of the proposed framework: the GOC 500-bus system and a modified Polish 2383-bus system.School of Computing and Augmented Intelligence (SCAI) Arizona State UniversityElectrical Engineering Department São Paulo State University (UNESP), São PauloElectrical Engineering Department São Paulo State University (UNESP), São PauloArizona State UniversityUniversidade Estadual Paulista (UNESP)Skolfield, J. KyleEscobar, Laura M. [UNESP]Escobedo, Adolfo R.2022-04-28T19:51:57Z2022-04-28T19:51:57Z2022-01-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://dx.doi.org/10.1007/s10479-022-04643-1Annals of Operations Research.1572-93380254-5330http://hdl.handle.net/11449/22364610.1007/s10479-022-04643-12-s2.0-85126371599Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengAnnals of Operations Researchinfo:eu-repo/semantics/openAccess2022-04-28T19:51:57Zoai:repositorio.unesp.br:11449/223646Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462022-04-28T19:51:57Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false
dc.title.none.fl_str_mv Derivation and generation of path-based valid inequalities for transmission expansion planning
title Derivation and generation of path-based valid inequalities for transmission expansion planning
spellingShingle Derivation and generation of path-based valid inequalities for transmission expansion planning
Skolfield, J. Kyle
Mathematical modeling
Mixed-integer linear programming
OR in energy
Transmission expansion planning
Valid inequalities
title_short Derivation and generation of path-based valid inequalities for transmission expansion planning
title_full Derivation and generation of path-based valid inequalities for transmission expansion planning
title_fullStr Derivation and generation of path-based valid inequalities for transmission expansion planning
title_full_unstemmed Derivation and generation of path-based valid inequalities for transmission expansion planning
title_sort Derivation and generation of path-based valid inequalities for transmission expansion planning
author Skolfield, J. Kyle
author_facet Skolfield, J. Kyle
Escobar, Laura M. [UNESP]
Escobedo, Adolfo R.
author_role author
author2 Escobar, Laura M. [UNESP]
Escobedo, Adolfo R.
author2_role author
author
dc.contributor.none.fl_str_mv Arizona State University
Universidade Estadual Paulista (UNESP)
dc.contributor.author.fl_str_mv Skolfield, J. Kyle
Escobar, Laura M. [UNESP]
Escobedo, Adolfo R.
dc.subject.por.fl_str_mv Mathematical modeling
Mixed-integer linear programming
OR in energy
Transmission expansion planning
Valid inequalities
topic Mathematical modeling
Mixed-integer linear programming
OR in energy
Transmission expansion planning
Valid inequalities
description This paper seeks to solve the long-term transmission expansion planning problem in power systems more effectively by reducing the solution search space and the computational effort. The proposed methodology finds and adds cutting planes based on structural insights about bus angle differences along paths. Two lemmas and a theorem are proposed which formally establish the validity of these cutting planes onto the underlying mathematical formulations. These path-based bus angle difference constraints, which tighten the relaxed feasible region, are used in combination with branch-and-bound to find lower bounds on the optimal investment of the transmission expansion planning problem. This work also creates an algorithm that automates the process of finding and applying the most effective valid inequalities, resulting in significantly reduced testing and computational time. The algorithm is implemented in Python, using Gurobi to add constraints and solve the exact DCOPF-based transmission expansion problem. This paper uses two different-sized systems to illustrate the effectiveness of the proposed framework: the GOC 500-bus system and a modified Polish 2383-bus system.
publishDate 2022
dc.date.none.fl_str_mv 2022-04-28T19:51:57Z
2022-04-28T19:51:57Z
2022-01-01
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://dx.doi.org/10.1007/s10479-022-04643-1
Annals of Operations Research.
1572-9338
0254-5330
http://hdl.handle.net/11449/223646
10.1007/s10479-022-04643-1
2-s2.0-85126371599
url http://dx.doi.org/10.1007/s10479-022-04643-1
http://hdl.handle.net/11449/223646
identifier_str_mv Annals of Operations Research.
1572-9338
0254-5330
10.1007/s10479-022-04643-1
2-s2.0-85126371599
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Annals of Operations Research
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
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
_version_ 1803047431352352768