A transmission-constrained unit commitment method in power system scheduling
Decision Support Systems - Special issue on restructuring the electric power business—a new paradigm for reducing regulation
Perspective cuts for a class of convex 0–1 mixed integer programs
Mathematical Programming: Series A and B
Mathematical Programming: Series A and B
| Hi-index | 0.00 |
This paper examines a preprocessing technique for a Mixed Integer Linear Programming (MILP) formulation of the Transmission-Constrained Unit Commitment problem (TC-UC). Incorporating transmission constraints into the Unit Commitment problem can significantly increase the size and difficulty of the problem. By examining the structure of the transmission network, variables that have no impact on the quality of the overall solution can be identified and removed. This preprocessing can reduce the time needed to solve the linear programming relaxation of the MILP, and as a result, the MILP itself. Illinois's transmission network was used to test the benefit of the proposed technique. Preprocessing was able to remove 30% of the buses in the transmission network. This reduction led to a significant decrease in the time needed to solve a 24h TC-UC problem. An added benefit of the preprocessing is that symmetry can be introduced into the problem. Identifying this symmetry and exploiting it can improve overall solution times even further.