Specialized heuristic algorithms for AC transmission expansion planning problem

Detalhes bibliográficos
Autor(a) principal: Gutierrez, Jose Nicolas Melchor [UNESP]
Data de Publicação: 2018
Outros Autores: Romero, Ruben A., Mancarella, Pierluigi
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/AUPEC.2018.8758038
http://hdl.handle.net/11449/221325
Resumo: In recent years, AC power flow equations have been gaining relevance to represent the transmission planning problem. This trend will continue growing because of fast improvements of both computational resources and robust optimization techniques. Relevant problems associated with the voltage magnitude and reactive power may be difficult to represent in the transmission planning problem if the DC mathematical formulation is used instead of the AC formulation. However, the AC formulation remains difficult to solve even with the nowadays solution methodologies. Therefore, the development of new methods that allows to solve effectively the AC formulation are highly relevant. In this paper, novel heuristic methods to solve the transmission planning problem are proposed. The results show that the proposed heuristics for the AC transmission planning problem are both effective and efficient to solve the problem. Moreover, it has been determined the most suitable heuristic criteria for the proposed heuristics. The simulations are performed in the North Northeast Brazilian test system.
id UNSP_06a5780e9e26ba78adb758295f46477f
oai_identifier_str oai:repositorio.unesp.br:11449/221325
network_acronym_str UNSP
network_name_str Repositório Institucional da UNESP
repository_id_str 2946
spelling Specialized heuristic algorithms for AC transmission expansion planning problemAC formulationHeuristic algorithmPower systemTransmission planningIn recent years, AC power flow equations have been gaining relevance to represent the transmission planning problem. This trend will continue growing because of fast improvements of both computational resources and robust optimization techniques. Relevant problems associated with the voltage magnitude and reactive power may be difficult to represent in the transmission planning problem if the DC mathematical formulation is used instead of the AC formulation. However, the AC formulation remains difficult to solve even with the nowadays solution methodologies. Therefore, the development of new methods that allows to solve effectively the AC formulation are highly relevant. In this paper, novel heuristic methods to solve the transmission planning problem are proposed. The results show that the proposed heuristics for the AC transmission planning problem are both effective and efficient to solve the problem. Moreover, it has been determined the most suitable heuristic criteria for the proposed heuristics. The simulations are performed in the North Northeast Brazilian test system.Department of Electrical Engineering Sao Paulo State UniversityDepartment of Electrical and Electronic Engineering University of MelbourneSchool of Electrical and Electronic University of ManchesterDepartment of Electrical Engineering Sao Paulo State UniversityUniversidade Estadual Paulista (UNESP)University of MelbourneUniversity of ManchesterGutierrez, Jose Nicolas Melchor [UNESP]Romero, Ruben A.Mancarella, Pierluigi2022-04-28T19:27:27Z2022-04-28T19:27:27Z2018-11-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObjecthttp://dx.doi.org/10.1109/AUPEC.2018.8758038Australasian Universities Power Engineering Conference, AUPEC 2018.http://hdl.handle.net/11449/22132510.1109/AUPEC.2018.87580382-s2.0-85069517019Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengAustralasian Universities Power Engineering Conference, AUPEC 2018info:eu-repo/semantics/openAccess2022-04-28T19:27:27Zoai:repositorio.unesp.br:11449/221325Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-08-05T18:16:00.695691Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false
dc.title.none.fl_str_mv Specialized heuristic algorithms for AC transmission expansion planning problem
title Specialized heuristic algorithms for AC transmission expansion planning problem
spellingShingle Specialized heuristic algorithms for AC transmission expansion planning problem
Gutierrez, Jose Nicolas Melchor [UNESP]
AC formulation
Heuristic algorithm
Power system
Transmission planning
title_short Specialized heuristic algorithms for AC transmission expansion planning problem
title_full Specialized heuristic algorithms for AC transmission expansion planning problem
title_fullStr Specialized heuristic algorithms for AC transmission expansion planning problem
title_full_unstemmed Specialized heuristic algorithms for AC transmission expansion planning problem
title_sort Specialized heuristic algorithms for AC transmission expansion planning problem
author Gutierrez, Jose Nicolas Melchor [UNESP]
author_facet Gutierrez, Jose Nicolas Melchor [UNESP]
Romero, Ruben A.
Mancarella, Pierluigi
author_role author
author2 Romero, Ruben A.
Mancarella, Pierluigi
author2_role author
author
dc.contributor.none.fl_str_mv Universidade Estadual Paulista (UNESP)
University of Melbourne
University of Manchester
dc.contributor.author.fl_str_mv Gutierrez, Jose Nicolas Melchor [UNESP]
Romero, Ruben A.
Mancarella, Pierluigi
dc.subject.por.fl_str_mv AC formulation
Heuristic algorithm
Power system
Transmission planning
topic AC formulation
Heuristic algorithm
Power system
Transmission planning
description In recent years, AC power flow equations have been gaining relevance to represent the transmission planning problem. This trend will continue growing because of fast improvements of both computational resources and robust optimization techniques. Relevant problems associated with the voltage magnitude and reactive power may be difficult to represent in the transmission planning problem if the DC mathematical formulation is used instead of the AC formulation. However, the AC formulation remains difficult to solve even with the nowadays solution methodologies. Therefore, the development of new methods that allows to solve effectively the AC formulation are highly relevant. In this paper, novel heuristic methods to solve the transmission planning problem are proposed. The results show that the proposed heuristics for the AC transmission planning problem are both effective and efficient to solve the problem. Moreover, it has been determined the most suitable heuristic criteria for the proposed heuristics. The simulations are performed in the North Northeast Brazilian test system.
publishDate 2018
dc.date.none.fl_str_mv 2018-11-01
2022-04-28T19:27:27Z
2022-04-28T19:27:27Z
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/AUPEC.2018.8758038
Australasian Universities Power Engineering Conference, AUPEC 2018.
http://hdl.handle.net/11449/221325
10.1109/AUPEC.2018.8758038
2-s2.0-85069517019
url http://dx.doi.org/10.1109/AUPEC.2018.8758038
http://hdl.handle.net/11449/221325
identifier_str_mv Australasian Universities Power Engineering Conference, AUPEC 2018.
10.1109/AUPEC.2018.8758038
2-s2.0-85069517019
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Australasian Universities Power Engineering Conference, AUPEC 2018
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_ 1808128914162188288