Algorithm 2. | Sub-algorithm: Finding a network reconfiguration |
| For all nodes, look for the unique path to the source node 1) Browse in the opposite direction of the network (from the last node to the previous one) If there is possibility, Continue from step 1 else 2) Browse in the direction of tie-switches become closed switches Check if the system is stable (There is no redundancy of nodes) If yes Continue from step 1 else 3) Browse in the forward direction (from the current node to the next) If there is possibility Continue from step 1 else Save and delete the current node of the chain Continue from step 2 Browse in the forward direction (from the current node to the next) If there is possibility Continue from step 1 else Save and delete the current node of the chain Continue from step 2 End if End if End if If there is a single path to the source node for all nodes The new configuration is radial Save the paths Constitute each branch according to the paths of the reconfigured network Repositioning the loads according to the end-of-branch nodes fed by each branch Back up the new reconfigured network |