A meta-heuristic approach to the unit commitment problem under network constraints
Autor(a) principal: | |
---|---|
Data de Publicação: | 2008 |
Outros Autores: | , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://repositorio.inesctec.pt/handle/123456789/1591 |
Resumo: | Purpose - The purpose of this paper is to solve the problem of committing electric power generators (unit commitment, UC), considering network constraints. Design/methodology/approach - The UC is first solved with a local search based meta-heuristic, following the assumption that all generators and loads are connected to a single network node. For evaluation purposes, the economical production levels of the units committed are computed by running a pre-dispatch algorithm where network constraints are not included. If a good quality solution is reached, an economic dispatch (ED) with network constraints is performed, where the geographic location of generators and loads are considered. Therefore, the production level of each committed generator is performed that leads to the global lowest solution cost, regarding both the generators' costs and constraints and the power system network constraints. Findings - The algorithm proposed is computationally efficient, given the time available for decision making. In addition, the solution for this algorithm, in terms of minimization of total costs, is generally better than the solution of the two phases approach. Some contractual and legal aspects related with the injection in network connections can also be included in the model. Practical implications - UC with network constraints has a large potential of use, especially for small and medium size power systems. It reflects reality in a closer way and provides a more complete and |
id |
RCAP_8da808f35fc21f9964771d2b20c10e92 |
---|---|
oai_identifier_str |
oai:repositorio.inesctec.pt:123456789/1591 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
A meta-heuristic approach to the unit commitment problem under network constraintsPurpose - The purpose of this paper is to solve the problem of committing electric power generators (unit commitment, UC), considering network constraints. Design/methodology/approach - The UC is first solved with a local search based meta-heuristic, following the assumption that all generators and loads are connected to a single network node. For evaluation purposes, the economical production levels of the units committed are computed by running a pre-dispatch algorithm where network constraints are not included. If a good quality solution is reached, an economic dispatch (ED) with network constraints is performed, where the geographic location of generators and loads are considered. Therefore, the production level of each committed generator is performed that leads to the global lowest solution cost, regarding both the generators' costs and constraints and the power system network constraints. Findings - The algorithm proposed is computationally efficient, given the time available for decision making. In addition, the solution for this algorithm, in terms of minimization of total costs, is generally better than the solution of the two phases approach. Some contractual and legal aspects related with the injection in network connections can also be included in the model. Practical implications - UC with network constraints has a large potential of use, especially for small and medium size power systems. It reflects reality in a closer way and provides a more complete and2017-11-16T12:33:56Z2008-01-01T00:00:00Z2008info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://repositorio.inesctec.pt/handle/123456789/1591engAna VianaManuel MatosJorge Correia PereiraBogdan G. Lucusinfo:eu-repo/semantics/embargoedAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-05-15T10:20:11Zoai:repositorio.inesctec.pt:123456789/1591Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T17:52:47.751588Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
A meta-heuristic approach to the unit commitment problem under network constraints |
title |
A meta-heuristic approach to the unit commitment problem under network constraints |
spellingShingle |
A meta-heuristic approach to the unit commitment problem under network constraints Ana Viana |
title_short |
A meta-heuristic approach to the unit commitment problem under network constraints |
title_full |
A meta-heuristic approach to the unit commitment problem under network constraints |
title_fullStr |
A meta-heuristic approach to the unit commitment problem under network constraints |
title_full_unstemmed |
A meta-heuristic approach to the unit commitment problem under network constraints |
title_sort |
A meta-heuristic approach to the unit commitment problem under network constraints |
author |
Ana Viana |
author_facet |
Ana Viana Manuel Matos Jorge Correia Pereira Bogdan G. Lucus |
author_role |
author |
author2 |
Manuel Matos Jorge Correia Pereira Bogdan G. Lucus |
author2_role |
author author author |
dc.contributor.author.fl_str_mv |
Ana Viana Manuel Matos Jorge Correia Pereira Bogdan G. Lucus |
description |
Purpose - The purpose of this paper is to solve the problem of committing electric power generators (unit commitment, UC), considering network constraints. Design/methodology/approach - The UC is first solved with a local search based meta-heuristic, following the assumption that all generators and loads are connected to a single network node. For evaluation purposes, the economical production levels of the units committed are computed by running a pre-dispatch algorithm where network constraints are not included. If a good quality solution is reached, an economic dispatch (ED) with network constraints is performed, where the geographic location of generators and loads are considered. Therefore, the production level of each committed generator is performed that leads to the global lowest solution cost, regarding both the generators' costs and constraints and the power system network constraints. Findings - The algorithm proposed is computationally efficient, given the time available for decision making. In addition, the solution for this algorithm, in terms of minimization of total costs, is generally better than the solution of the two phases approach. Some contractual and legal aspects related with the injection in network connections can also be included in the model. Practical implications - UC with network constraints has a large potential of use, especially for small and medium size power systems. It reflects reality in a closer way and provides a more complete and |
publishDate |
2008 |
dc.date.none.fl_str_mv |
2008-01-01T00:00:00Z 2008 2017-11-16T12:33:56Z |
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://repositorio.inesctec.pt/handle/123456789/1591 |
url |
http://repositorio.inesctec.pt/handle/123456789/1591 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/embargoedAccess |
eu_rights_str_mv |
embargoedAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799131603395411968 |