Optimal Reserve Dispatch Approach Considering Complicated Contingency Scenarios

Traditional reserve optimization usually specify the requirements as fixed system constraints, which of two shortcomings:one is can not reflect the different scenarios'requirements to reserve with different corresponce rate, the other is hard to consider complicated contingency scenarios. According to the difficulty of traditional optimization methods, this paper presented an optimal reserve dispatch model considering contingency scenarios based on security constrained unit commitment (SCUC). By introducing scenarios classification and scenarios set, this paper establish a correspondence between contingency scenarios and reserve with different rate, that is:instantaneous reserve(AGC) adjust to instantaneous scenarios while 10min spinning reserve to slowly changing scene. Integrated with unit commitment, power dispatch, reserve distribution and the reserve capacity optimization of the contingency scenarios, the optimization model is to minimize the sum cost of the electricity and reserve while subjected to the security constraints conditions of base case and contingency scenarios. Therefore, the reserve demand and dispatch of different response rate are decided by the requirement of different types of scenarios, rather than the reserve demand constraints conditions. This complicated mixed-integer linear programming problem is modeled by GAMS and solved by CPLEX. The Numerical examples on IEEE30 bus test system show that: the results of the proposed model are more reasonable and effective than the traditional method; the proposed model can not only consider the single scenario, but also the multiple scenarios and the scenarios set, which provides a new idea for the set the reserve optimization.