A Connectivity Constrained MILP Model for Optimal Transmission Switching

This letter formulates network connectivity as Miller-Tucker-Zemlin (MTZ) constraints and incorporates them into the mixed-integer linear programming (MILP) model for the optimal transmission switching (OTS) problem. The connectivity constraints are linear and for a power network with n buses, m branches, and d loads in pre-contingency or each post-contingency state there are approximately O(n + 5m + d) constraints, and O(n) continuous and O(2 m) binary variables, which is much smaller than those in the existing formulations. The MILP OTS model with the proposed connectivity constraints can be readily solved by well-developed MILP solvers. Case studies on the PJM 5-bus system, IEEE 300-bus system, and French 1888-bus system validate the effectiveness of the proposed model.

Automated summary

This study incorporates network connectivity into the mixed-integer linear programming model to solve the optimal transmission switching problem, effectively reducing the number of constraints. Case studies validate the effectiveness of the proposed model.