Optimal Overcurrent Relay Solutions for Protection Coordination Using Metaheuristics Approaches with Penalty Function Method

Abstract

This paper presents the development of overcurrent relay coordination (OCRC) problem formulation by implementing five well known metaheuristic algorithms that are Ant Lion Optimizer (ALO), Moth Flame Optimizer (MFO), Grey Wolf Optimizer (GWO), Particles Swarm Optimizer (PSO) and Barnacles Matting Optimizer (BMO). The algorithms are assisted with penalty function method during the selection of new agents/ offsprings to confirm the generations that violated the constraints are superseded during the next generation selection. The OCRC is established by manipulating the current known as plus setting (PS) and time delay known as time multiplier setting (TMS) parameters. The optimized value of the TMS and PS will be selected using the algorithms to ensure the minimize result of the objective function. The algorithms are tested to three test systems which are IEEE 3 bus, 8 bus and 15 bus system to validate the efficiency and superiority of the proposed algorithms. The obtained results from those five algorithms are then compared. The simulation results show that MFO, BMO and GWO perform better objective function result and efficiently optimize the TMS and PS value of the OCRC problem without neglecting the inequality constraints.