Redundant and Nonbinding Transmission Constraints Identification Method Combining Physical and Economic Insights of Unit Commitment

Cost-Driven Screening of Network Constraints for the Unit Commitment Problem

“…For this purpose, we build bounding problems that do not only account for technical aspects of the UC problem but also economic ones. To our knowledge, only the recently published paper [20] is in the spirit of our proposal, although they do not follow the trail of bounding-based methods. More specifically, they propose a heuristic algorithm that runs as follows: First, they address the UC without the network, the solution to which they call cost-based schedule.…”

“…Specifically, the only element in D is the vector of nodal net demands in the hour in question (which is assumed to be known or predicted). In this way, we can compare the bounding-based constraint-screening methods BN and UB with the data-driven and heuristic ones proposed in [5] and [20], respectively. Notice that, when D is a singleton, methods CC and UB+CC become correspondingly equivalent to BN and UB.…”

“…Nevertheless, similar empirical findings are obtained for a number of neighbors equal to 5 and 500. As for the heuristic constraint-screening method introduced in [20], which we denote as H, the tuning parameter on which this method depends has been set to 3% as the authors in [20] suggest.…”

Tight Data-Driven Linear Relaxations for Constraint Screening in Robust Unit Commitment

“…The drawback of [15] is the ignorance of correlated patterns in historical samples of the load and renewable generation. Recently, an analytical approach was proposed by [17] based on a constraint generation algorithm and heuristics to eliminate nonbinding constraints from UC problems on top of redundant constraints.…”

Cost-driven Screening of Network Constraints for the Unit Commitment Problem

“…For this purpose, we build bounding problems that do not only account for technical aspects of the UC problem but also economic ones. To our knowledge, only the recently published paper [21] is in the spirit of our proposal, although they do not follow the trail of bounding-based methods. More specifically, they propose a heuristic algorithm that runs as follows: First, they address the UC without the network, the solution to which they call cost-based schedule.…”