Optimal coordination of overcurrent relays using Honey Bee algorithm

The key issue in selecting the relay settings is to achieve the minimum possible operating times while maintaining coordination among all relays. For optimizing coordination of overcurrent relays, linear programming techniques such as simplex, two-phase simplex and dual simplex are used. Heuristic techniques become the best solution to solve such problems. In this paper, The LP relay coordination problem is solved using the Honey Bee algorithm, which is one of the heuristic techniques capable of solving constrained optimization problems.