Optimum coordination of overcurrent relay timing using continuous genetic algorithm
Overcurrent relays (OCR) are the major protection devices in a distribution system. To reduce the power outages, mal-operation of the backup relays should be avoided, and therefore, OCR time coordination in power distribution network is a major concern of protection engineer. The OCR time coordination in ring fed distribution networks is a highly constrained optimization problem. The purpose is to find an optimum relay setting to minimize the time of operation of relays and at the same time, to avoid the mal-operation of relays. This paper presents continuous genetic algorithm (CGA) technique for optimum coordination of OCR in a ring fed distribution system. Constraints are incorporated in the fitness function making use of the penalty method. The CGA is inherently faster than binary genetic algorithm (GA) because the chromosomes do not have to be decoded. Also the CGA gives an advantage of requiring less storage than binary GA.
continuous genetic algorithms constrained optimization linear programming problem overcurrent relay coordination