الفهرس 
PROPOSED OPTIMIZATION ALGORITHMS BACKGROUNDOnly 14 pages are availabe for public view
 |  | from | 32 |  |  |
| | | from | 32 | | |
Abstract
Abstract
Coordination is one of the essential studies in power system protection. The main aim for the coordination study is to increase the reliability of the system by discriminating the faulty sections of the system without affecting the whole system operation. So, a specific study is needed to determine the pickup currents and the pickup times to minimize the sum of total time dial setting of all relays to guarantee the fastest and the accurate performance.
The coordination problem can be divided into two parts. The first part is to determine the primary and the backup relays. The primary and backup relays must satisfy that the backup must be delayed certain time to let the primary take the action to operate. The delayed time is based on the type of the used relays. In radial systems the arrangement of the primary and backup relays are very simple. In this thesis, the study mainly focuses on ring systems. For large systems, especially with large number of loops, the break point set is needed. The break point set is the set of relays will turn the system into radial system if they are all open. This set will facilitate the primary and backup arrangement. To accurately count the number of loops in any system the k-tree algorithm is utilized. The output figures from the k-tree algorithm are facilitating the selection of the relays to create the break point set. The proposed algorithm is tested using three IEEE 6 bus, 14 bus, and 30 bus system.
The second part of the coordination problem is the optimization part. For this part two optimization techniques are applied to verify the result on each technique. The output of the optimization problem is the pickup currents, or the pickup time or both. Two objective function are tested whether it is better to calculate the time dial settings at the far end or the sum of time at the near and the far end. The thesis is divided into 6 chapters, chapter 1 is the introduction of thesis, chapter 2 is the review of literatures, chapter 3 is the coordination problem formulation, chapter 4 is the proposed optimization algorithms background, chapter 5 is the simulation results, and chapter 6 is the conclusion and recommendations for future work.