Abstract

Relay coordination problem is highly constrained optimization problem. Heuristic techniques are often used to solve optimization problem. These techniques have a drawback of converging to a non-optimum solution due to the wide range of design variables. On the other hand, initial solution becomes difficult to find with shorter range of design variables. This paper presents modified adaptive teaching learning based optimization algorithm to overcome this drawback of conventional heuristic techniques. The coordination problem is formulated as a constrained non-linear optimization problem to determine the optimum solution for the time multiplier setting (TMS) and plug setting (PS) of DOCRs. Initial solution for TMS is heuristically obtained with the commonly chosen widest range for TMS values. The upper bound of TMS range then substituted by the maximum TMS value in the first initial solution. The new upper limit is obviously lower than the earlier one. Next phase of optimization is carried out with the new range of TMS for the pre-determined iterations of teacher phase. Consequent to the completion of the teacher phase, new upper bound is obtained from the available solution and optimization is carried out for the pre-determined iterations of learner phase. This process is repeated to get the optimum solution. Fixed range for PS is used to obtain the selectivity. Such a strategy of iteratively updating the upper bound of TMS range shows remarkable improvement over the techniques which employ fixed TMS range. This algorithm is tested on different networks and has been found more effective. Four case studies have been presented here to show the effectiveness of the proposed algorithm. The impact of distributed generation (DG) and application of superconducting fault current limiter to mitigate DG impact is presented in case study—III.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.