R3TO: Algorithm for the Routing of Electrical Networks with Pole Allocation and Obstacle Transposition

The increase in energy consumption and the need to maintain continuity in supply, make it essential to plan for the expansion of electricity networks. Although there is extensive literature regarding the automatic generation of distribution network routing, the costs for pole allocation still deserve attention. This study presents the R3TO proposal, which combines Evolutionary Algorithms, with the deterministic Dijkstra algorithm, to solve network routing problems considering the adequacy of pole allocation. R3TO is able to determine the posting in a network, with minimization in the number of posts and transposition of obstacles, such as rivers or roads. In order to evaluate the method, tests were performed in a theoretical area and in a mapping of a pilot test region in a real area. The results obtained with the R3TO showed a cost reduction when compared to the traditional deterministic algorithm, and was successful in allocating poles across restricted areas, shortening the total path. Thus, it was proven that R3TO generates a minimized path, and with suggested positions for pole placement presenting good perspectives to improve current approaches to the problem.