# Analysis On Feeder Reconfiguration Problem

1469 Words6 Pages
Feeder Reconfiguration is basically an optimization problem which has several objectives and operating constraints. A. Merlin and H. Black were the first to implement optimization techniques to solve a Feeder Reconfiguration problem. Optimization is a mathematical tool to obtain an optimized solution. There are numerous techniques to solve an optimization problem where in each technique will yield a different network topology and different optimized solution. Heuristic and meta-Heuristic methods were used in the early 90’s to solve feeder reconfiguration problem. These methods uses many assumptions to yield an optimal solution. However, the solution obtained by heuristic method is considered to be sub-optimal in compared with the…show more content…
The voltage variations at a particular node should be with in _-^+5%.
〖V_i〗^(p min)≤ 〖V_i〗^p≤ 〖V_i〗^(p max) Limit on the current capacity of the Feeder:
|〖I_k〗^p |≤〖I_k〗^(p max ) k ∈ {1,2,3,4,…..,l} Radial Configuration Constraint: The main idea behind considering these constraint is get rid of from unwanted current from the system’s current flow. So we are considering many constraints for following the radial configuration of the network. For choosing the switch also we are following some rules. We need to close the switches of the mesh which is not at all a part of loop or no sources has been connected. Limit on operation of Switches: 
The tie switches and the sectionalizing switches have a constraints on number of times they can be operated in order for the system to operate normally. The feeder reconfiguration problem is an optimization problem which considers all the possible constraints and hence this constraint should also be taken into account. Maintaining radial nature of the network:  As the topology of the network is being changed from time to time, reconfiguration should be done in such a way