Algoritmo tabu search especializado para o problema da reconfiguração de alimentadores em sistemas de distribuição radiais
Autor(a) principal: | |
---|---|
Data de Publicação: | 2022 |
Tipo de documento: | Trabalho de conclusão de curso |
Idioma: | por |
Título da fonte: | Repositório Institucional da UNESP |
Texto Completo: | http://hdl.handle.net/11449/216818 |
Resumo: | The purpose of this work is to develop an algorithm that resolves the optimal reconfiguration problem using the reformulated Tabu Search metaheuristic, that is, a program which minimizes the active power losses in distribution systems. To solve this problem the algorithm must determine a radial topology, by analysing the branches of this system. The radial topology is built by opening and closing the branches switches. The principal objective is find a topology that provides the lowest active power losses for the system which is the optimal solution of the reconfiguration problem. The metaheuristic chosen and used to reach this objective was the reformulated Tabu Search. This heuristic basically departs from an initial solution, called incumbent solution, and construct the neighborhood of this solution which is the other solutions generated by closing the opened branches of the initial solution and opening the closed branches of the loop of this respective now closed branch. Each solution proposal has one power flow value per branch, that is, we are considering that the system has a fixed demand. By setting the number of iterations that the program will repeat the presented method, this heuristic could find that optimal solution. The entire algorithm was implemented using the FORTRAN language. The proposed algorithm was tested with the 14, 33 and 84-buses systems. The results were compared to the results reached with the fellow main project in developing in Brazil. It was also compared to other works developed in the researcher background laboratory. Those results have an excellent quality, and they surpassed the expectations for this level work. |
id |
UNSP_48d608eb40a41270981684eec91aa14c |
---|---|
oai_identifier_str |
oai:repositorio.unesp.br:11449/216818 |
network_acronym_str |
UNSP |
network_name_str |
Repositório Institucional da UNESP |
repository_id_str |
2946 |
spelling |
Algoritmo tabu search especializado para o problema da reconfiguração de alimentadores em sistemas de distribuição radiaisTabu search algorithm specialized for the reconfiguration problem in radial distribution systemsReconfiguration problemReformulated Tabu SearchMetaheuristicRadial topologyActive power lossesNeighborhoodVizinhançaBusca tabuProblema da reconfiguraçãoTopologia radialPerdas de potência ativaThe purpose of this work is to develop an algorithm that resolves the optimal reconfiguration problem using the reformulated Tabu Search metaheuristic, that is, a program which minimizes the active power losses in distribution systems. To solve this problem the algorithm must determine a radial topology, by analysing the branches of this system. The radial topology is built by opening and closing the branches switches. The principal objective is find a topology that provides the lowest active power losses for the system which is the optimal solution of the reconfiguration problem. The metaheuristic chosen and used to reach this objective was the reformulated Tabu Search. This heuristic basically departs from an initial solution, called incumbent solution, and construct the neighborhood of this solution which is the other solutions generated by closing the opened branches of the initial solution and opening the closed branches of the loop of this respective now closed branch. Each solution proposal has one power flow value per branch, that is, we are considering that the system has a fixed demand. By setting the number of iterations that the program will repeat the presented method, this heuristic could find that optimal solution. The entire algorithm was implemented using the FORTRAN language. The proposed algorithm was tested with the 14, 33 and 84-buses systems. The results were compared to the results reached with the fellow main project in developing in Brazil. It was also compared to other works developed in the researcher background laboratory. Those results have an excellent quality, and they surpassed the expectations for this level work.O propósito deste trabalho é desenvolver um algoritmo que resolve o problema da reconfiguração de alimentadores em sistemas de distribuição (PRSDR) usando a meta heurística da busca tabu, isto é, um programa capaz de minimizar as perdas de potência ativa em sistemas de distribuição. Para resolver tal problema, o algoritmo deve encontrar e fornecer uma topologia radial, analisando os ramos dos sistemas. Essa topologia é construída através da abertura e do fechamento das chaves de manobra desses ramos. O principal objetivo é encontrar a topologia radial que fornece o menor valor de perdas de potência ativa, a qual realiza trabalho, para cada sistema. Essa topologia é a solução ótima do problema de reconfiguração. A meta heurística escolhida e utilizada para atingir esse objetivo foi a Busca Tabu. Essa heurística parte de uma solução inicial, chamada solução incumbente, e constrói a vizinhança dessa solução, sendo essa última o conjunto de soluções geradas fechando-se os ramos abertos da solução inicial e abrindo os ramos fechados do laço respectivo ao ramo agora fechado e ativo. Cada proposta de solução possui um valor de fluxo de potência por ramo, isto é, considerou-se que o sistema possui uma demanda fixa. Definindo o número de iterações que o algoritmo irá repetir o método apresentado, a meta-heurística é capaz de encontrar a solução ótima. Todo o corpo do algoritmo foi implementado usando a linguagem FORTRAN e foi implementado e testado para os sistemas de 14, 33, 84 e 136 barras. Os resultados obtidos foram comparados aos resultados de outros trabalhos desenvolvidos na literatura, e se mostraram de excelente qualidade, muito além das expectativas para um trabalho de graduação.Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)FAPESP: 2019/13563-0Universidade Estadual Paulista (Unesp)Lázaro, Rubén Augusto Romero [UNESP]Universidade Estadual Paulista (Unesp)Darini, Lucas Fernandes2022-02-18T20:47:57Z2022-02-18T20:47:57Z2022-02-04info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/bachelorThesisapplication/pdfhttp://hdl.handle.net/11449/216818porinfo:eu-repo/semantics/openAccessreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESP2024-01-01T06:16:07Zoai:repositorio.unesp.br:11449/216818Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-08-05T21:49:51.780225Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false |
dc.title.none.fl_str_mv |
Algoritmo tabu search especializado para o problema da reconfiguração de alimentadores em sistemas de distribuição radiais Tabu search algorithm specialized for the reconfiguration problem in radial distribution systems |
title |
Algoritmo tabu search especializado para o problema da reconfiguração de alimentadores em sistemas de distribuição radiais |
spellingShingle |
Algoritmo tabu search especializado para o problema da reconfiguração de alimentadores em sistemas de distribuição radiais Darini, Lucas Fernandes Reconfiguration problem Reformulated Tabu Search Metaheuristic Radial topology Active power losses Neighborhood Vizinhança Busca tabu Problema da reconfiguração Topologia radial Perdas de potência ativa |
title_short |
Algoritmo tabu search especializado para o problema da reconfiguração de alimentadores em sistemas de distribuição radiais |
title_full |
Algoritmo tabu search especializado para o problema da reconfiguração de alimentadores em sistemas de distribuição radiais |
title_fullStr |
Algoritmo tabu search especializado para o problema da reconfiguração de alimentadores em sistemas de distribuição radiais |
title_full_unstemmed |
Algoritmo tabu search especializado para o problema da reconfiguração de alimentadores em sistemas de distribuição radiais |
title_sort |
Algoritmo tabu search especializado para o problema da reconfiguração de alimentadores em sistemas de distribuição radiais |
author |
Darini, Lucas Fernandes |
author_facet |
Darini, Lucas Fernandes |
author_role |
author |
dc.contributor.none.fl_str_mv |
Lázaro, Rubén Augusto Romero [UNESP] Universidade Estadual Paulista (Unesp) |
dc.contributor.author.fl_str_mv |
Darini, Lucas Fernandes |
dc.subject.por.fl_str_mv |
Reconfiguration problem Reformulated Tabu Search Metaheuristic Radial topology Active power losses Neighborhood Vizinhança Busca tabu Problema da reconfiguração Topologia radial Perdas de potência ativa |
topic |
Reconfiguration problem Reformulated Tabu Search Metaheuristic Radial topology Active power losses Neighborhood Vizinhança Busca tabu Problema da reconfiguração Topologia radial Perdas de potência ativa |
description |
The purpose of this work is to develop an algorithm that resolves the optimal reconfiguration problem using the reformulated Tabu Search metaheuristic, that is, a program which minimizes the active power losses in distribution systems. To solve this problem the algorithm must determine a radial topology, by analysing the branches of this system. The radial topology is built by opening and closing the branches switches. The principal objective is find a topology that provides the lowest active power losses for the system which is the optimal solution of the reconfiguration problem. The metaheuristic chosen and used to reach this objective was the reformulated Tabu Search. This heuristic basically departs from an initial solution, called incumbent solution, and construct the neighborhood of this solution which is the other solutions generated by closing the opened branches of the initial solution and opening the closed branches of the loop of this respective now closed branch. Each solution proposal has one power flow value per branch, that is, we are considering that the system has a fixed demand. By setting the number of iterations that the program will repeat the presented method, this heuristic could find that optimal solution. The entire algorithm was implemented using the FORTRAN language. The proposed algorithm was tested with the 14, 33 and 84-buses systems. The results were compared to the results reached with the fellow main project in developing in Brazil. It was also compared to other works developed in the researcher background laboratory. Those results have an excellent quality, and they surpassed the expectations for this level work. |
publishDate |
2022 |
dc.date.none.fl_str_mv |
2022-02-18T20:47:57Z 2022-02-18T20:47:57Z 2022-02-04 |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/bachelorThesis |
format |
bachelorThesis |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/11449/216818 |
url |
http://hdl.handle.net/11449/216818 |
dc.language.iso.fl_str_mv |
por |
language |
por |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Universidade Estadual Paulista (Unesp) |
publisher.none.fl_str_mv |
Universidade Estadual Paulista (Unesp) |
dc.source.none.fl_str_mv |
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_ |
1808129363030310912 |