Solving the Network Maze: Discovering the Optimal Heuristic Algorithms for Effectively Connecting Electrical Networks via a Single Path

Wilson Pavón; Esteban Inga; Doris Andrade

doi:10.1109/ICECCME57830.2023.10252923

Solving the Network Maze: Discovering the Optimal Heuristic Algorithms for Effectively Connecting Electrical Networks via a Single Path

Wilson Pavón, Esteban Inga, Doris Andrade

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

The approach introduced in this study is an innovative framework that merges heuristic methods and graph theory techniques to optimize network routing within a geographical region. It aims to efficiently connect all users in the network, offering near-optimal solutions. The model's effectiveness is demonstrated in finding good solutions for network routing through implementation in a random scenario. This approach is precious for planners and designers grappling with network routing challenges, providing an efficient and effective solution. With its potential to assist in the design process across diverse contexts, this model holds promise for facilitating network planning and enhancing the overall efficiency of network systems.

Original language	English
Title of host publication	International Conference on Electrical, Computer, Communications and Mechatronics Engineering, ICECCME 2023
Publisher	Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)	9798350322972
DOIs	https://doi.org/10.1109/ICECCME57830.2023.10252923
State	Published - 2023
Event	2023 International Conference on Electrical, Computer, Communications and Mechatronics Engineering, ICECCME 2023 - Tenerife, Canary Islands, Spain Duration: 19 Jul 2023 → 21 Jul 2023

Publication series

Name	International Conference on Electrical, Computer, Communications and Mechatronics Engineering, ICECCME 2023

Conference

Conference	2023 International Conference on Electrical, Computer, Communications and Mechatronics Engineering, ICECCME 2023
Country/Territory	Spain
City	Tenerife, Canary Islands
Period	19/07/23 → 21/07/23

Bibliographical note

Publisher Copyright:
© 2023 IEEE.

Keywords

algorithms
electrical networks
graph theory
heuristics
network planning
optimal routing

Access to Document

10.1109/ICECCME57830.2023.10252923

Cite this

Pavón, W., Inga, E., & Andrade, D. (2023). Solving the Network Maze: Discovering the Optimal Heuristic Algorithms for Effectively Connecting Electrical Networks via a Single Path. In International Conference on Electrical, Computer, Communications and Mechatronics Engineering, ICECCME 2023 (International Conference on Electrical, Computer, Communications and Mechatronics Engineering, ICECCME 2023). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICECCME57830.2023.10252923

Pavón, Wilson ; Inga, Esteban ; Andrade, Doris. / Solving the Network Maze : Discovering the Optimal Heuristic Algorithms for Effectively Connecting Electrical Networks via a Single Path. International Conference on Electrical, Computer, Communications and Mechatronics Engineering, ICECCME 2023. Institute of Electrical and Electronics Engineers Inc., 2023. (International Conference on Electrical, Computer, Communications and Mechatronics Engineering, ICECCME 2023).

@inproceedings{d4e2492716b84a41a327d0c4814fc13a,

title = "Solving the Network Maze: Discovering the Optimal Heuristic Algorithms for Effectively Connecting Electrical Networks via a Single Path",

abstract = "The approach introduced in this study is an innovative framework that merges heuristic methods and graph theory techniques to optimize network routing within a geographical region. It aims to efficiently connect all users in the network, offering near-optimal solutions. The model's effectiveness is demonstrated in finding good solutions for network routing through implementation in a random scenario. This approach is precious for planners and designers grappling with network routing challenges, providing an efficient and effective solution. With its potential to assist in the design process across diverse contexts, this model holds promise for facilitating network planning and enhancing the overall efficiency of network systems.",

keywords = "algorithms, electrical networks, graph theory, heuristics, network planning, optimal routing",

author = "Wilson Pav{\'o}n and Esteban Inga and Doris Andrade",

note = "Publisher Copyright: {\textcopyright} 2023 IEEE.; 2023 International Conference on Electrical, Computer, Communications and Mechatronics Engineering, ICECCME 2023 ; Conference date: 19-07-2023 Through 21-07-2023",

year = "2023",

doi = "10.1109/ICECCME57830.2023.10252923",

language = "English",

series = "International Conference on Electrical, Computer, Communications and Mechatronics Engineering, ICECCME 2023",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

booktitle = "International Conference on Electrical, Computer, Communications and Mechatronics Engineering, ICECCME 2023",

address = "United States",

}

Pavón, W , Inga, E & Andrade, D 2023, Solving the Network Maze: Discovering the Optimal Heuristic Algorithms for Effectively Connecting Electrical Networks via a Single Path. in International Conference on Electrical, Computer, Communications and Mechatronics Engineering, ICECCME 2023. International Conference on Electrical, Computer, Communications and Mechatronics Engineering, ICECCME 2023, Institute of Electrical and Electronics Engineers Inc., 2023 International Conference on Electrical, Computer, Communications and Mechatronics Engineering, ICECCME 2023, Tenerife, Canary Islands, Spain, 19/07/23. https://doi.org/10.1109/ICECCME57830.2023.10252923

Solving the Network Maze: Discovering the Optimal Heuristic Algorithms for Effectively Connecting Electrical Networks via a Single Path. / Pavón, Wilson ; Inga, Esteban ; Andrade, Doris.
International Conference on Electrical, Computer, Communications and Mechatronics Engineering, ICECCME 2023. Institute of Electrical and Electronics Engineers Inc., 2023. (International Conference on Electrical, Computer, Communications and Mechatronics Engineering, ICECCME 2023).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Solving the Network Maze

T2 - 2023 International Conference on Electrical, Computer, Communications and Mechatronics Engineering, ICECCME 2023

AU - Pavón, Wilson

AU - Inga, Esteban

AU - Andrade, Doris

PY - 2023

Y1 - 2023

N2 - The approach introduced in this study is an innovative framework that merges heuristic methods and graph theory techniques to optimize network routing within a geographical region. It aims to efficiently connect all users in the network, offering near-optimal solutions. The model's effectiveness is demonstrated in finding good solutions for network routing through implementation in a random scenario. This approach is precious for planners and designers grappling with network routing challenges, providing an efficient and effective solution. With its potential to assist in the design process across diverse contexts, this model holds promise for facilitating network planning and enhancing the overall efficiency of network systems.

AB - The approach introduced in this study is an innovative framework that merges heuristic methods and graph theory techniques to optimize network routing within a geographical region. It aims to efficiently connect all users in the network, offering near-optimal solutions. The model's effectiveness is demonstrated in finding good solutions for network routing through implementation in a random scenario. This approach is precious for planners and designers grappling with network routing challenges, providing an efficient and effective solution. With its potential to assist in the design process across diverse contexts, this model holds promise for facilitating network planning and enhancing the overall efficiency of network systems.

KW - algorithms

KW - electrical networks

KW - graph theory

KW - heuristics

KW - network planning

KW - optimal routing

UR - http://www.scopus.com/inward/record.url?scp=85174058035&partnerID=8YFLogxK

U2 - 10.1109/ICECCME57830.2023.10252923

DO - 10.1109/ICECCME57830.2023.10252923

M3 - Conference contribution

AN - SCOPUS:85174058035

T3 - International Conference on Electrical, Computer, Communications and Mechatronics Engineering, ICECCME 2023

BT - International Conference on Electrical, Computer, Communications and Mechatronics Engineering, ICECCME 2023

PB - Institute of Electrical and Electronics Engineers Inc.

Y2 - 19 July 2023 through 21 July 2023

ER -

Pavón W , Inga E , Andrade D. Solving the Network Maze: Discovering the Optimal Heuristic Algorithms for Effectively Connecting Electrical Networks via a Single Path. In International Conference on Electrical, Computer, Communications and Mechatronics Engineering, ICECCME 2023. Institute of Electrical and Electronics Engineers Inc. 2023. (International Conference on Electrical, Computer, Communications and Mechatronics Engineering, ICECCME 2023). doi: 10.1109/ICECCME57830.2023.10252923

Solving the Network Maze: Discovering the Optimal Heuristic Algorithms for Effectively Connecting Electrical Networks via a Single Path

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this