부산대학교 도서관

In this paper, security constrained reserve management (SCRM) problem is formulated. In this trend, security constrained economic dispatch as well as operating reserve in both normal and ${N-1}$ contingency condition are considered. To address the computational complexity associated with the SCRM problem, the distributed-SCRM (D-SCRM) is proposed. In the suggested method, the power system is decomposed to several subsystems called zone. These zones are interconnected via some tie-lines. By defining two virtual generation units at the middle of each tie-line, all neighbor zones become isolated. This causes the main SCRM problem to be converted to some subproblems. To solve these subproblems, some initial values are first dedicated to the virtual generation units. Next, the independent SCRM subproblems are solved simultaneously using the genetic algorithm (GA). The objective function is then calculated for the main problem and the virtual values are updated using the GA again. This process continues until the global optimum is obtained. IEEE 24-bus, 39-bus, and 118-bus test systems are considered to evaluate the proposed algorithm. Results confirm the effectiveness of proposed algorithm.