Dynamic security constrained multi-area unit commitment

An approach is presented for multiarea unit commitment which takes the power system dynamic stability limit into account. Dynamic programming is employed to perform unit commitment on the whole system. The eigenvalues for the resultant hourly generation schedules are examined to see if they satisfy the prespecified dynamic security criterion. If the requirement is not met at certain hours, an iterative algorithm is employed to reduce the interarea line flows gradually and to perform area redispatch and, if necessary, area unit commitment, in order for the resultant generation schedule to satisfy the requirement. The goal is to achieve a multiarea generation schedule which meets the conventional requirements of having lowest fuel costs with the spinning reserves and steady-state transmission capacity limits satisfied, and offers good dynamic performance through the enforcement of dynamic security constraints