Application of optimization algorithms in the development of a real-time coordination system for overcurrent relays

Abstract

In this ongoing effort, optimization methods are being used to create a coordinated system for overcurrent relays that operates in realtime. There are several potential methods for coordinating the overcurrent relays, but each has its own set of performance benefits that the others lack. This effort entails the development and evaluation of three separate algorithmic strategies in order to accomplish this goal. After using the GA (Genetic Algorithm) as a baseline for performance, the DE (Differential evolution) & ACO (Ant Colony Optimization) are programmed and equated to it. DE and ACO were preferred because their excellent performance were recorded across various types of literature, and since no one in the security industry had ever attempted to implement them. This resulted in their being deemed the most suitable adoptees. As the number of coordination pairs increased, GA produced the worst results, was the slowest and had the greatest influence on execution time. This was learned by examining the discrepancies between the three algorithms’ outputs. Both ACO and DE, in contrast to GA, are much faster, provide better results, and are virtually immune to a rise in the number of coordination pairs.