Good Morning. I am currently developing a project for which I need to make the preliminary design of the electricity distribution network topology for a population. For this I have the location of the consumers (numbers in red) and the Medium Voltage nodes (numbers in blue) (MV). As shown in the following image:
Using the Network Analyst tools, the possible routes between the different points are generated, within a specified radius, from which the following network is obtained:
The following distribution of the MT nodes to the BT nodes is found with the Closest Facility tool of the Network Analyst:
This solution is an approximation, but it presents some errors, such as the one observed between nodes 85 and 3, because the most logical solution would be the one observed in the following image:
I am looking for this solution to be generated automatically or semi-automatically, but that does not require adding a restriction manually like the one shown in the previous image. The problem stems from the fact that the algorithm used by Closest Facility always looks for the smallest route from the MT node to the consumption (BT) node, but does not consider that it can arrive from an already connected BT node.
I would appreciate your collaboration with some explanation, or the suggestion of a tool or configuration that allows me to perform the procedure outlined.