Security check for scheduling plans based on contingency screening and parallel computation for multi-period cases

Abstract

Since security check for scheduling plans faces the problem of heavy computing burdens and inefficient utilization of parallel computation platform, a method based on contingency screening and parallel computation for multi-period cases is proposed to complete the calculation within a given time. Scheduling plans are divided into groups with adjacent time stamps based on core number of parallel computation platform and average number of screened contingencies to ensure that transient stability analysis, static security analysis and dynamic stability analysis can be finished in similar time. Security check results of day-ahead, intraday and real-time plan are designated with priority from low to high to form the queue for contingency screening. Queue of security check results will be updated once the security and stability analysis of a plan with higher priority is finished. Plans with available historical results will be chosen to reduce the number of plans needing security and stability analysis for all contingencies. The procedure of security check consists of three stages, including power flow data generation, security and stability analysis and decision-making. Dispatch strategy will finish the calculation of all plans at each stage and allocate cores by the submission time of plans to ensure load balance. Real engineering applications in actual power grid have fully confirmed the validity and rapidity of this method.