Optimal Heuristic Algorithms for Connecting Electrical Networks using an unique Path

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publication2023 IEEE IAS Global Conference on Renewable Energy and Hydrogen Technologies, GlobConHT 2023
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9798350332117
ISBN (Print)9798350332117
DOIs
StatePublished - 2023
Event2023 IEEE IAS Global Conference on Renewable Energy and Hydrogen Technologies, GlobConHT 2023 - Male, Maldives
Duration: 11 Mar 202312 Mar 2023

Publication series

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

Conference

Conference2023 IEEE IAS Global Conference on Renewable Energy and Hydrogen Technologies, GlobConHT 2023
Country/TerritoryMaldives
CityMale
Period11/03/2312/03/23

Bibliographical note

Publisher Copyright:
© 2023 IEEE.

Keywords

  • algorithms
  • electrical networks
  • graph theory
  • heuristic
  • network planning
  • optimal routing

Fingerprint

Dive into the research topics of 'Optimal Heuristic Algorithms for Connecting Electrical Networks using an unique Path'. Together they form a unique fingerprint.

Cite this