Optimal Heuristic Algorithms for Connecting Electrical Networks using an unique Path

Producción científica: Capítulo del libro/informe/acta de congresoContribución de conferenciarevisión exhaustiva

2 Citas (Scopus)

Resumen

In this paper, we present a model for optimizing network routing in a geographic area. Our approach combines heuristic and graph theory techniques to find near-optimal solutions to the problem of connecting all users in the network. The model was implemented in a random scenario, and the results showed that it is effective at finding good solutions to this problem. This work is relevant for planners and designers who are working on network routing issues, as it provides a useful approach for finding solutions that are both efficient and effective. Overall, our model has the potential to aid in the design process for planning networks in a variety of different contexts.

Idioma originalInglés
Título de la publicación alojada2023 IEEE IAS Global Conference on Renewable Energy and Hydrogen Technologies, GlobConHT 2023
EditorialInstitute of Electrical and Electronics Engineers Inc.
ISBN (versión digital)9798350332117
DOI
EstadoPublicada - 2023
Evento2023 IEEE IAS Global Conference on Renewable Energy and Hydrogen Technologies, GlobConHT 2023 - Male, Maldivas
Duración: 11 mar. 202312 mar. 2023

Serie de la publicación

Nombre2023 IEEE IAS Global Conference on Renewable Energy and Hydrogen Technologies, GlobConHT 2023

Conferencia

Conferencia2023 IEEE IAS Global Conference on Renewable Energy and Hydrogen Technologies, GlobConHT 2023
País/TerritorioMaldivas
CiudadMale
Período11/03/2312/03/23

Nota bibliográfica

Publisher Copyright:
© 2023 IEEE.

Huella

Profundice en los temas de investigación de 'Optimal Heuristic Algorithms for Connecting Electrical Networks using an unique Path'. En conjunto forman una huella única.

Citar esto