Multi-start metaheuristic for transmission system expansion planning using a transportation model
Autor(a) principal: | |
---|---|
Data de Publicação: | 2018 |
Outros Autores: | , |
Tipo de documento: | Artigo de conferência |
Idioma: | por |
Título da fonte: | Repositório Institucional da UNESP |
Texto Completo: | http://dx.doi.org/10.1109/SBSE.2018.8395745 http://hdl.handle.net/11449/232773 |
Resumo: | This work presents a multi-start metaheuristic for transmission system expansion planning. The transmission network is modelled as a transportation network. The method progresses in two stages: constructive phase and local search phase. In construction phase, the diversification is carried out where the search space is explored to obtain feasible solutions of good quality. In local search phase, the intensification is carried out. It is based on the intensive search in the vicinity of feasible solutions found in the construction phase. The test systems of Garver six-bus network, IEEE 24-bus network and Southern 46-bus network were represented using the transport model. The results demonstrate the efficiency of the adopted strategy. All the optimal solutions of the aforementioned test systems were found with a reduced number of linear programming problems solved and also with reduced computational time. |
id |
UNSP_847d92c706764c36306531b57ac60c07 |
---|---|
oai_identifier_str |
oai:repositorio.unesp.br:11449/232773 |
network_acronym_str |
UNSP |
network_name_str |
Repositório Institucional da UNESP |
repository_id_str |
2946 |
spelling |
Multi-start metaheuristic for transmission system expansion planning using a transportation modelCombinatorial OptimizationMulti-Start MetaheuristicTransmission System Expansion PlanningTransportation ModelThis work presents a multi-start metaheuristic for transmission system expansion planning. The transmission network is modelled as a transportation network. The method progresses in two stages: constructive phase and local search phase. In construction phase, the diversification is carried out where the search space is explored to obtain feasible solutions of good quality. In local search phase, the intensification is carried out. It is based on the intensive search in the vicinity of feasible solutions found in the construction phase. The test systems of Garver six-bus network, IEEE 24-bus network and Southern 46-bus network were represented using the transport model. The results demonstrate the efficiency of the adopted strategy. All the optimal solutions of the aforementioned test systems were found with a reduced number of linear programming problems solved and also with reduced computational time.Departamento de Engenharia Elétrica Universidade Estadual Paulista 'Júlio de Mesquita Filho'Departamento de Engenharia de Energia Universidade Estadual Paulista 'Júlio de Mesquita Filho'Departamento de Engenharia Elétrica Universidade Estadual Paulista 'Júlio de Mesquita Filho'Departamento de Engenharia de Energia Universidade Estadual Paulista 'Júlio de Mesquita Filho'Universidade Estadual Paulista (UNESP)Da Silva, Silvia Mara Lima [UNESP]Romero, Ruben [UNESP]De Faria, Lucas Teles [UNESP]2022-04-30T10:59:36Z2022-04-30T10:59:36Z2018-06-25info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObject1-6http://dx.doi.org/10.1109/SBSE.2018.8395745SBSE 2018 - 7th Brazilian Electrical Systems Symposium, p. 1-6.http://hdl.handle.net/11449/23277310.1109/SBSE.2018.83957452-s2.0-85050243719Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPporSBSE 2018 - 7th Brazilian Electrical Systems Symposiuminfo:eu-repo/semantics/openAccess2024-07-04T19:07:14Zoai:repositorio.unesp.br:11449/232773Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-08-05T13:33:31.783169Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false |
dc.title.none.fl_str_mv |
Multi-start metaheuristic for transmission system expansion planning using a transportation model |
title |
Multi-start metaheuristic for transmission system expansion planning using a transportation model |
spellingShingle |
Multi-start metaheuristic for transmission system expansion planning using a transportation model Da Silva, Silvia Mara Lima [UNESP] Combinatorial Optimization Multi-Start Metaheuristic Transmission System Expansion Planning Transportation Model |
title_short |
Multi-start metaheuristic for transmission system expansion planning using a transportation model |
title_full |
Multi-start metaheuristic for transmission system expansion planning using a transportation model |
title_fullStr |
Multi-start metaheuristic for transmission system expansion planning using a transportation model |
title_full_unstemmed |
Multi-start metaheuristic for transmission system expansion planning using a transportation model |
title_sort |
Multi-start metaheuristic for transmission system expansion planning using a transportation model |
author |
Da Silva, Silvia Mara Lima [UNESP] |
author_facet |
Da Silva, Silvia Mara Lima [UNESP] Romero, Ruben [UNESP] De Faria, Lucas Teles [UNESP] |
author_role |
author |
author2 |
Romero, Ruben [UNESP] De Faria, Lucas Teles [UNESP] |
author2_role |
author author |
dc.contributor.none.fl_str_mv |
Universidade Estadual Paulista (UNESP) |
dc.contributor.author.fl_str_mv |
Da Silva, Silvia Mara Lima [UNESP] Romero, Ruben [UNESP] De Faria, Lucas Teles [UNESP] |
dc.subject.por.fl_str_mv |
Combinatorial Optimization Multi-Start Metaheuristic Transmission System Expansion Planning Transportation Model |
topic |
Combinatorial Optimization Multi-Start Metaheuristic Transmission System Expansion Planning Transportation Model |
description |
This work presents a multi-start metaheuristic for transmission system expansion planning. The transmission network is modelled as a transportation network. The method progresses in two stages: constructive phase and local search phase. In construction phase, the diversification is carried out where the search space is explored to obtain feasible solutions of good quality. In local search phase, the intensification is carried out. It is based on the intensive search in the vicinity of feasible solutions found in the construction phase. The test systems of Garver six-bus network, IEEE 24-bus network and Southern 46-bus network were represented using the transport model. The results demonstrate the efficiency of the adopted strategy. All the optimal solutions of the aforementioned test systems were found with a reduced number of linear programming problems solved and also with reduced computational time. |
publishDate |
2018 |
dc.date.none.fl_str_mv |
2018-06-25 2022-04-30T10:59:36Z 2022-04-30T10:59:36Z |
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/SBSE.2018.8395745 SBSE 2018 - 7th Brazilian Electrical Systems Symposium, p. 1-6. http://hdl.handle.net/11449/232773 10.1109/SBSE.2018.8395745 2-s2.0-85050243719 |
url |
http://dx.doi.org/10.1109/SBSE.2018.8395745 http://hdl.handle.net/11449/232773 |
identifier_str_mv |
SBSE 2018 - 7th Brazilian Electrical Systems Symposium, p. 1-6. 10.1109/SBSE.2018.8395745 2-s2.0-85050243719 |
dc.language.iso.fl_str_mv |
por |
language |
por |
dc.relation.none.fl_str_mv |
SBSE 2018 - 7th Brazilian Electrical Systems Symposium |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
1-6 |
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_ |
1808128246392291328 |