Search

This paper studies the optimal transmission switching (OTS) problem for power systems, where certain lines are fixed (uncontrollable) and the remaining ones are controllable via on/off switches. The goal is to identify a topology of the power grid that minimizes the cost of the system operation while satisfying the physical and operational constraints. Most of the existing methods for the problem are based on first converting the OTS into a mixed-integer linear program (MILP) or mixed-integer quadratic program (MIQP), and then iteratively solving a series of its convex relaxations. The performance of these methods depends heavily on the strength of the MILP or MIQP formulations. In this paper, it is shown that finding the strongest variable upper and lower bounds to be used in an MILP or MIQP formulation of the OTS based on the big- $M$ or McCormick inequalities is NP-hard. Furthermore, it is proven that unless $P=NP$ , there is no constant-factor approximation algorithm for constructing these variable bounds. Despite the inherent difficulty of obtaining the strongest bounds in general, a simple bound strengthening method is presented to strengthen the convex relaxation of the problem when there exists a connected spanning subnetwork of the system with fixed lines. With the proposed bound strengthening method, remarkable improvements in the runtime of the mixed-integer solvers and the optimality gaps of the solutions are achieved for medium- and large-scale real-world systems. [ABSTRACT FROM AUTHOR]

System operators are required to serve the load in the most cost-effective way while maintaining the integrity of the system and heeding reliability requirements. In the day-ahead market, operators acquire reserves in an attempt to guarantee N-1 reliability; yet, reserve deliverability is not guaranteed. Prior research has shown that the use of transmission switching, or topology control, may help improve reserve deliverability. In this paper, transmission switching is used as a corrective mechanism to help the system achieve N-1-1 reliability, where not only has the system lost a single element, but also it experiences the loss of a second major element after an adjustment period. In an attempt to preserve N-1-1 reliability, for this paper, a day-ahead unit commitment model that acquires supplementary reserves is solved. The day-ahead market solution is then tested for N-1-1 reliability using contingency analysis models with and without transmission switching. The methodology can be employed at the day-ahead time stage to ensure the system has acquired sufficient supplemental reserves. The results demonstrate that not only can corrective transmission switching be beneficial post-contingency without inhibiting the ability to return to N-1 reliability, but it can also help obtain an N-1-1 reliable solution. [ABSTRACT FROM AUTHOR]

Direct current (DC) network has been recognized as a promising technique especially for shipboard power systems (SPSs). Fast resilience control is required for an SPS to survive after faults. Towards this end, this paper proposes the indices of survivability and functionality based on which a two-phase resilience control method is derived. The on/off status of loads is determined in the first phase to maximize survivability, while the functionality of supplying loads are maximized in the second phase. Based on a comprehensive model of a DC-SPS, the two-phase method renders two mixed-integer non-convex problems. To make the problems tractable, we develop second-order-cone-based convex relaxations, thus converting the problems into mixed-integer convex problems. Though this approach does not necessarily guarantee feasible, hence global, solutions to the original nonconvex formulations, we provide additional mild assumptions, which ensures that the convex relaxations are exact when the line constraints are not binding. In the case of inexactness, we provide a simple heuristic approach to ensure feasible solutions. Numerical tests empirically confirm the efficacy of the proposed method. [ABSTRACT FROM AUTHOR]

In this paper, we model topology control through transmission switching as a recourse action in the day-ahead operation of power systems with large-scale renewable generation resources. We prove that transmission switching could only reduce the linear objective value of direct current optimal power flow when congestion exists. However, we also show, through a simple example, that unit commitment cost could be reduced by transmission switching even in the absence of congestion. To solve the stochastic unit commitment with topology control within reasonable computational time, we proposed a heuristic that first decomposes a practical system into zones and then solves the problem for each zone in parallel. The benefit of topology control recourse is demonstrated on a network representing the Central European System. We compare the costs of the network with different loading and renewable generation conditions. The cost reduction of the test system can reach 3.34% with heavy load and large-scale renewable generation while in a single zone the cost reduction can be above 7%. [ABSTRACT FROM PUBLISHER]

The European Union is targeting a 20% share of energy from renewable resources by 2020, and this increase is in turn expected to lead to operational challenges that will require various congestion management actions by system operators. In this paper, we deal with topology control of the transmission network as a congestion management resource and evaluate the impacts of topology control on the European electricity network. To do this, we co-optimize unit commitment and transmission switching over 24 h, and we use a decomposition scheme to tackle the resulting large-scale problem. Our analysis is conducted on different scenarios of load and renewable power generation. We find that topology control results in significant cost savings within Europe which tend to be inversely related to net load. The robustness of our results is supported by an extensive sensitivity analysis. [ABSTRACT FROM AUTHOR]

Optimal transmission switching (OTS) optimizes simultaneously the generation dispatch and the topology of a power system. It has been shown that taking some transmission lines out of service can significantly reduce the operating cost of the system while respecting the traditional deterministic N-1 security criterion of operational reliability. However, topology modifications could adversely affect probabilistic security metrics. The operational reliability of a power system can be translated into a cost by multiplying the expected energy not served by the value of lost load. This paper therefore explores whether it is possible to maintain a positive economic balance with OTS when considering not only the cost of generation but also the expected socio-economic cost of disruptions in the supply. This is done in two steps: the computation of an N-1 secure OTS and then the calculation of a probabilistic estimate of the operational reliability of the OTS solution. Based on the results obtained with two test systems, it is shown that OTS tends to significantly degrade probabilistic measures of security. It is thus not obvious that OTS can lead to a positive economic balance, even when N-1 security is enforced. Consequently, a probabilistic security analysis should be performed before implementing an OTS solution. [ABSTRACT FROM AUTHOR]

Economic transmission switching has been proposed as a new control paradigm to improve the economics of electric power systems. In practice, the transmission switching operation itself is a disruptive action to the system. Frequently switching lines into or out of service can create undesirable effects on the security and reliability of power systems and may require new investments in the automation and control systems. In this paper, we formulate an economic seasonal transmission switching model where transmission switching occurs once at the beginning of a time period (season) and then the transmission topology remains unchanged during that period. The proposed seasonal transmission switching model is a large-scale mixed integer programming problem. The objective of the optimization model is to minimize the total energy generation cost over the season subject to loads and N-1 reliability requirements. We develop a novel decomposition method that decomposes the seasonal problem into one-hour problems which are then solved efficiently. We demonstrate our model and the decomposition approach on the 14-bus, 39-bus, and 118-bus power systems and show potential cost savings in each case. [ABSTRACT FROM PUBLISHER]

This paper introduces load shed recovery actions for transmission networks by presenting the dc optimal load shed recovery with transmission switching model (DCOLSR-TS). The model seeks to reduce the amount of load shed, which may result due to transmission line and/or generator contingencies, by modifying the bulk power system topology. Since solving DCOLSR-TS is computationally difficult, the current work also develops a heuristic (MIP-H), which improves the system topology while specifying the required sequence of switching operations. Experimental results on a list of N-1 and N-2 critical contingencies of the IEEE 118-bus test case demonstrate the advantages of utilizing MIP-H for both online load shed recovery and recurring contingency-response analysis. This is reinforced by the introduction of a parallelized version of the heuristic (Par-MIP-H), which solves the list of critical contingencies close to 5x faster than MIP-H with 8 cores and up to 14x faster with increased computational resources. The current work also tests MIP-H on a real-life, large-scale network in order to measure the computational performance of this tool on a real-world implementation. [ABSTRACT FROM AUTHOR]