A search space reduction method for transmission expansion planning using an iterative refinement of the DC Load Flow model

dc.contributor.authorPloussard, Quentines-ES
dc.contributor.authorOlmos Camacho, Luises-ES
dc.contributor.authorRamos Galán, Andréses-ES
dc.date.accessioned2019-11-27T04:20:33Z
dc.date.available2019-11-27T04:20:33Z
dc.date.issued2020-01-01es_ES
dc.descriptionArtículos en revistases_ES
dc.description.abstractThis paper provides a new methodology to compute a reduced but efficient set of candidate lines in a transmission expansion planning (TEP) context. Considering this reduced set of candidate lines should lead to similar investment decisions as if all the possible ac and dc candidate lines that could be installed in the network were considered. A first «hybrid» relaxed TEP problem is solved. Based on this initial solution, a new relaxed TEP problem is iteratively solved in which the dc load flow (DCLF) model is enforced to a certain extent in the partially expanded ac corridors. Once a convergence threshold has been reached, an upper bound of the number of candidate ac and dc lines to install in each corridor can be defined. This process results in a compact search space. Our algorithm has been implemented in General Algebraic Modeling Software (GAMS) and has been tested on a case study based on the European power system. The method produces very promising results and in the considered case study, leads to a very efficient investment.es-ES
dc.description.abstractThis paper provides a new methodology to compute a reduced but efficient set of candidate lines in a transmission expansion planning (TEP) context. Considering this reduced set of candidate lines should lead to similar investment decisions as if all the possible ac and dc candidate lines that could be installed in the network were considered. A first «hybrid» relaxed TEP problem is solved. Based on this initial solution, a new relaxed TEP problem is iteratively solved in which the dc load flow (DCLF) model is enforced to a certain extent in the partially expanded ac corridors. Once a convergence threshold has been reached, an upper bound of the number of candidate ac and dc lines to install in each corridor can be defined. This process results in a compact search space. Our algorithm has been implemented in General Algebraic Modeling Software (GAMS) and has been tested on a case study based on the European power system. The method produces very promising results and in the considered case study, leads to a very efficient investment.en-GB
dc.description.versioninfo:eu-repo/semantics/publishedVersiones_ES
dc.format.mimetypeapplication/pdfes_ES
dc.identifier.doi10.1109/TPWRS.2019.2930719es_ES
dc.identifier.issn0885-8950es_ES
dc.identifier.urihttps://doi.org/10.1109/TPWRS.2019.2930719es_ES
dc.keywordsDimension Reduction; Integer linear programming; Transmission Expansion Planning; Relaxation methodses-ES
dc.keywordsDimension Reduction; Integer linear programming; Transmission Expansion Planning; Relaxation methodsen-GB
dc.language.isoen-GBes_ES
dc.rightsCreative Commons Reconocimiento-NoComercial-SinObraDerivada Españaes_ES
dc.rights.accessRightsinfo:eu-repo/semantics/openAccesses_ES
dc.rights.holderes_ES
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/es_ES
dc.sourceRevista: IEEE Transactions on Power Systems, Periodo: 1, Volumen: online, Número: 1, Página inicial: 152, Página final: 162es_ES
dc.subject.otherInstituto de Investigación Tecnológica (IIT)es_ES
dc.titleA search space reduction method for transmission expansion planning using an iterative refinement of the DC Load Flow modeles_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
local.metrics.updated2026-07-26T04:30:01Z
local.openalex.citedby25
local.openalex.idhttps://openalex.org/W2963160914

Files

Original bundle

Now showing 1 - 3 of 3
Loading...
Thumbnail Image
Name:
IIT-19-080A.pdf
Size:
1.31 MB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
IIT-19-080A_preview
Size:
2.88 KB
Format:
Unknown data format
Loading...
Thumbnail Image
Name:
IIT-19-080A_preview.pdf
Size:
2.88 KB
Format:
Adobe Portable Document Format

Collections