Logo PUC-Rio Logo Maxwell
TRABALHOS DE FIM DE CURSO @PUC-Rio
Consulta aos Conteúdos
Título: AUTOMATIC GENERATION OF ROUTE TRACINGS FOR TRANSMISSION LINES UNDER UNCERTAINTY
Autor(es): JOAO MARCOS DUSI VILELA
Colaborador(es): BRUNO FANZERES DOS SANTOS - Orientador
Catalogação: 19/FEV/2026 Língua(s): ENGLISH - UNITED STATES
Tipo: TEXT Subtipo: SENIOR PROJECT
Notas: [pt] Todos os dados constantes dos documentos são de inteira responsabilidade de seus autores. Os dados utilizados nas descrições dos documentos estão em conformidade com os sistemas da administração da PUC-Rio.
[en] All data contained in the documents are the sole responsibility of the authors. The data used in the descriptions of the documents are in conformity with the systems of the administration of PUC-Rio.
Referência(s): [en] https://www.maxwell.vrac.puc-rio.br/projetosEspeciais/TFCs/consultas/conteudo.php?strSecao=resultado&nrSeq=75446@2
DOI: https://doi.org/10.17771/PUCRio.acad.75446
Resumo:
Due to the expansion of national s electrical network system, the search for optimal construction routes for new transmission line projects has become relevant area of study in across Brazil’s energy sector. In infrastructural projects like these, construction expenses are very high and every attempt of reducing cost can have huge impact on budgeting. This work aims to develop a framework for automatic generation of transmission line tracings and discuss the impact of uncertainty over route definition. Three approaches were studied along the research process. The Dijkstra Algorithm and a Mixed-Integer Linear Problem (MILP) formulation were implemented using R and Julia programming languages, respectively. A third approach refers to an adaptation of MILP’s original formulation to handle uncertainty assumptions. To demonstrate solving capabilities of each approach, two case studies were chosen, where an attempt of route tracing were made. The first case was a route from substation Governador Parigot Souza to substation Santa Mônica, in which no uncertainty assumptions were included in the models. In this context, Dijkstra s algorithm outperformed MILP’s implementation for solution time, although both have the same results. For second case, a route between substations Campo Belo and Ourolândia II was defined. Results were promisors and the tracing, as expected, changed due to the insertion of the uncertainty factor, minimizing the proposed costs.
Descrição: Arquivo:   
COMPLETE PDF