Security constrained unit commitment scheduling: A new MILP formulation for solving transmission constraints

Autores
Alvarez, Gonzalo Exequiel; Marcovecchio, Marian Gabriela; Aguirre, Pio Antonio
Año de publicación
2018
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
This paper presents a new Mixed Integer Linear Programming model (MILP) to account for the Security-Constrained Unit Commitment Problem (SCUC). Transmission Constraints are introduced through bus balances, line power bound flows, and bus voltage angle differences. Line status is also considered. Binary variables regarding line status (active or inactive) are introduced for this purpose. These variables allow discrete decisions on the connectivity of buses, reducing the angle coupling between buses, with several advantages. Three examples are solved. The results indicate that this method can obtain feasible solutions with CPU times of 2.5 s (for a 6-bus system) and 500 s (for the IEEE 118-bus system), and they reached cost savings up to 4.9% of the total generating cost for one day of programming horizon, in comparison with classical models. Relations of the network are illustrated graphically, and an analysis of the results is presented through new evaluation indexes.
Fil: Alvarez, Gonzalo Exequiel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo y Diseño. Universidad Tecnológica Nacional. Facultad Regional Santa Fe. Instituto de Desarrollo y Diseño; Argentina
Fil: Marcovecchio, Marian Gabriela. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo y Diseño. Universidad Tecnológica Nacional. Facultad Regional Santa Fe. Instituto de Desarrollo y Diseño; Argentina
Fil: Aguirre, Pio Antonio. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo y Diseño. Universidad Tecnológica Nacional. Facultad Regional Santa Fe. Instituto de Desarrollo y Diseño; Argentina
Materia
MIXED INTEGER LINEAR PROGRAMMING
OPTIMIZATION
POWER SYSTEM SCHEDULING
TRANSMISSION CONSTRAINTS
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/86934
Acceder
id CONICETDig_a0d1175f3b91e694785e5539db1d54f0
oai_identifier_str oai:ri.conicet.gov.ar:11336/86934
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Security constrained unit commitment scheduling: A new MILP formulation for solving transmission constraintsAlvarez, Gonzalo ExequielMarcovecchio, Marian GabrielaAguirre, Pio AntonioMIXED INTEGER LINEAR PROGRAMMINGOPTIMIZATIONPOWER SYSTEM SCHEDULINGTRANSMISSION CONSTRAINTShttps://purl.org/becyt/ford/2.2https://purl.org/becyt/ford/2This paper presents a new Mixed Integer Linear Programming model (MILP) to account for the Security-Constrained Unit Commitment Problem (SCUC). Transmission Constraints are introduced through bus balances, line power bound flows, and bus voltage angle differences. Line status is also considered. Binary variables regarding line status (active or inactive) are introduced for this purpose. These variables allow discrete decisions on the connectivity of buses, reducing the angle coupling between buses, with several advantages. Three examples are solved. The results indicate that this method can obtain feasible solutions with CPU times of 2.5 s (for a 6-bus system) and 500 s (for the IEEE 118-bus system), and they reached cost savings up to 4.9% of the total generating cost for one day of programming horizon, in comparison with classical models. Relations of the network are illustrated graphically, and an analysis of the results is presented through new evaluation indexes.Fil: Alvarez, Gonzalo Exequiel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo y Diseño. Universidad Tecnológica Nacional. Facultad Regional Santa Fe. Instituto de Desarrollo y Diseño; ArgentinaFil: Marcovecchio, Marian Gabriela. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo y Diseño. Universidad Tecnológica Nacional. Facultad Regional Santa Fe. Instituto de Desarrollo y Diseño; ArgentinaFil: Aguirre, Pio Antonio. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo y Diseño. Universidad Tecnológica Nacional. Facultad Regional Santa Fe. Instituto de Desarrollo y Diseño; ArgentinaPergamon-Elsevier Science Ltd2018-07info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/86934Alvarez, Gonzalo Exequiel; Marcovecchio, Marian Gabriela; Aguirre, Pio Antonio; Security constrained unit commitment scheduling: A new MILP formulation for solving transmission constraints; Pergamon-Elsevier Science Ltd; Computers and Chemical Engineering; 115; 7-2018; 455-4730098-1354CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/http://linkinghub.elsevier.com/retrieve/pii/S0098135418304150info:eu-repo/semantics/altIdentifier/doi/10.1016/j.compchemeng.2018.05.001info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-03T09:52:35Zoai:ri.conicet.gov.ar:11336/86934instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-03 09:52:35.656CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Security constrained unit commitment scheduling: A new MILP formulation for solving transmission constraints
title Security constrained unit commitment scheduling: A new MILP formulation for solving transmission constraints
spellingShingle Security constrained unit commitment scheduling: A new MILP formulation for solving transmission constraints
Alvarez, Gonzalo Exequiel
MIXED INTEGER LINEAR PROGRAMMING
OPTIMIZATION
POWER SYSTEM SCHEDULING
TRANSMISSION CONSTRAINTS
title_short Security constrained unit commitment scheduling: A new MILP formulation for solving transmission constraints
title_full Security constrained unit commitment scheduling: A new MILP formulation for solving transmission constraints
title_fullStr Security constrained unit commitment scheduling: A new MILP formulation for solving transmission constraints
title_full_unstemmed Security constrained unit commitment scheduling: A new MILP formulation for solving transmission constraints
title_sort Security constrained unit commitment scheduling: A new MILP formulation for solving transmission constraints
dc.creator.none.fl_str_mv Alvarez, Gonzalo Exequiel
Marcovecchio, Marian Gabriela
Aguirre, Pio Antonio
author Alvarez, Gonzalo Exequiel
author_facet Alvarez, Gonzalo Exequiel
Marcovecchio, Marian Gabriela
Aguirre, Pio Antonio
author_role author
author2 Marcovecchio, Marian Gabriela
Aguirre, Pio Antonio
author2_role author
author
dc.subject.none.fl_str_mv MIXED INTEGER LINEAR PROGRAMMING
OPTIMIZATION
POWER SYSTEM SCHEDULING
TRANSMISSION CONSTRAINTS
topic MIXED INTEGER LINEAR PROGRAMMING
OPTIMIZATION
POWER SYSTEM SCHEDULING
TRANSMISSION CONSTRAINTS
purl_subject.fl_str_mv https://purl.org/becyt/ford/2.2
https://purl.org/becyt/ford/2
dc.description.none.fl_txt_mv This paper presents a new Mixed Integer Linear Programming model (MILP) to account for the Security-Constrained Unit Commitment Problem (SCUC). Transmission Constraints are introduced through bus balances, line power bound flows, and bus voltage angle differences. Line status is also considered. Binary variables regarding line status (active or inactive) are introduced for this purpose. These variables allow discrete decisions on the connectivity of buses, reducing the angle coupling between buses, with several advantages. Three examples are solved. The results indicate that this method can obtain feasible solutions with CPU times of 2.5 s (for a 6-bus system) and 500 s (for the IEEE 118-bus system), and they reached cost savings up to 4.9% of the total generating cost for one day of programming horizon, in comparison with classical models. Relations of the network are illustrated graphically, and an analysis of the results is presented through new evaluation indexes.
Fil: Alvarez, Gonzalo Exequiel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo y Diseño. Universidad Tecnológica Nacional. Facultad Regional Santa Fe. Instituto de Desarrollo y Diseño; Argentina
Fil: Marcovecchio, Marian Gabriela. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo y Diseño. Universidad Tecnológica Nacional. Facultad Regional Santa Fe. Instituto de Desarrollo y Diseño; Argentina
Fil: Aguirre, Pio Antonio. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo y Diseño. Universidad Tecnológica Nacional. Facultad Regional Santa Fe. Instituto de Desarrollo y Diseño; Argentina
description This paper presents a new Mixed Integer Linear Programming model (MILP) to account for the Security-Constrained Unit Commitment Problem (SCUC). Transmission Constraints are introduced through bus balances, line power bound flows, and bus voltage angle differences. Line status is also considered. Binary variables regarding line status (active or inactive) are introduced for this purpose. These variables allow discrete decisions on the connectivity of buses, reducing the angle coupling between buses, with several advantages. Three examples are solved. The results indicate that this method can obtain feasible solutions with CPU times of 2.5 s (for a 6-bus system) and 500 s (for the IEEE 118-bus system), and they reached cost savings up to 4.9% of the total generating cost for one day of programming horizon, in comparison with classical models. Relations of the network are illustrated graphically, and an analysis of the results is presented through new evaluation indexes.
publishDate 2018
dc.date.none.fl_str_mv 2018-07
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/86934
Alvarez, Gonzalo Exequiel; Marcovecchio, Marian Gabriela; Aguirre, Pio Antonio; Security constrained unit commitment scheduling: A new MILP formulation for solving transmission constraints; Pergamon-Elsevier Science Ltd; Computers and Chemical Engineering; 115; 7-2018; 455-473
0098-1354
CONICET Digital
CONICET
url http://hdl.handle.net/11336/86934
identifier_str_mv Alvarez, Gonzalo Exequiel; Marcovecchio, Marian Gabriela; Aguirre, Pio Antonio; Security constrained unit commitment scheduling: A new MILP formulation for solving transmission constraints; Pergamon-Elsevier Science Ltd; Computers and Chemical Engineering; 115; 7-2018; 455-473
0098-1354
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/http://linkinghub.elsevier.com/retrieve/pii/S0098135418304150
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.compchemeng.2018.05.001
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
application/pdf
application/pdf
dc.publisher.none.fl_str_mv Pergamon-Elsevier Science Ltd
publisher.none.fl_str_mv Pergamon-Elsevier Science Ltd
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1842269169508155392
score 13.13397

Publicaciones similares