An Approach for Integrated Generation and Transmission Maintenance Scheduling Considering N-1 Contingencies

This paper presents an approach for integrated generation and transmission maintenance scheduling model (IMS) that takes into consideration N-1 contingencies. The objective is to maximize the maintenance preference of facility owners while satisfying N-1 security and other constraints. To achieve this goal, Benders decomposition is employed to decompose the problem into a master problem and several sub-problems. A Relaxation Induced (RI) algorithm is proposed to efficiently solve the large mixed integer programming (MIP) master problem. This algorithm is based on the solution of the linear relaxed problem. It is demonstrated that the proposed algorithm can efficiently reach a near-optimal solution that is usually satisfactory. If this near-optimal solution is not acceptable, it is used as the initial solution to fast start the solution of the original IMS problem. The performance of the proposed method is demonstrated using a modified version of the IEEE 30-bus system and a model of the power system of a Chinese province. Case studies show that the proposed algorithm can improve the computational efficiency by more than an order of magnitude.