Reducing the Candidate Line List for Practical Integration of Switching into Power System Operation

TL;DR

This paper proposes a method to reduce the candidate line list for switching in power systems by adding constraints and costs to optimize real-time operation, improving efficiency and reducing maintenance.

Contribution

It introduces a new algorithm to identify less important lines for switching, enhancing the speed and practicality of transmission switching in power system optimization.

Findings

Faster OPF solutions with reduced candidate lines.

Effective selection of lines for switching under various load conditions.

Maintained system reliability while minimizing switching operations.

Abstract

Optimized operation of the transmission network is one solution to supply extra demand by more efficient use of transmission facilities, and line switching is one main tool to achieve this goal. In this paper, we add extra constraints to OPF formulation to limit the maximum number of switching operations in every hour based on network conditions, and add switching cost in the objective function to represent extra maintenance cost as a result of frequent switching. We also propose an algorithm to remove less important lines for switching in different loading conditions, so OPF with transmission switching will be solved faster for real-time operation. It is applied to a case study with several operation hours.