Surrogate Lagrangian relaxation and branch-and-cut for unit commitment with combined cycle units

Combined cycle (CC) units are efficient because heat from combustion turbines is not wasted but is used for steam turbines. However, when state transitions are followed, CC units complicate the unit commitment and economic dispatch (UCED) problem. While branch-and-cut has been successful in solving UCED problems without considering CC units, transitions in one such unit affect the entire problem. Therefore, the convex hull is difficult to obtain and the UCED problem with CC units is difficult to solve. To efficiently solve the problem, we exploit linearity as well as separability. To decompose the problem into subproblems associated with conventional and CC units, our recently developed surrogate Lagrangian relaxation will be used to relax coupling system-wide constraints, and each subproblem will then be solved by using branch-and-cut. Constraints as well as transitions within a CC unit are handled locally and no longer affect the entire problem. Moreover, we will demonstrate that branch-and-cut can handle individual subproblems much more efficiently as compared to the original problem. The linear structure of coupling constraints is then exploited to obtain feasible costs. Numerical results demonstrate that the new approach is computationally efficient and generates good feasible solutions.

[1]  X. Zhao,et al.  Surrogate Gradient Algorithm for Lagrangian Relaxation , 1999 .

[2]  Feng Zhao,et al.  Payment cost minimization auction for deregulated electricity markets using surrogate optimization , 2006, IEEE Transactions on Power Systems.

[3]  Jean-Louis Goffin,et al.  Convergence of a simple subgradient level method , 1999, Math. Program..

[4]  Dimitri P. Bertsekas,et al.  Incremental Subgradient Methods for Nondifferentiable Optimization , 2001, SIAM J. Optim..

[5]  J. A. Amalfi,et al.  An optimization-based method for unit commitment , 1992 .

[6]  Manfred W. Padberg,et al.  Classical Cuts for Mixed-Integer Programming and Branch-and-Cut , 2005, Ann. Oper. Res..

[7]  Mikhail A. Bragin,et al.  An efficient surrogate subgradient method within Lagrangian relaxation for the Payment Cost Minimization problem , 2012, 2012 IEEE Power and Energy Society General Meeting.

[8]  E. Grant Read,et al.  Co-Optimization of Energy and Ancillary Service Markets , 2010 .

[9]  Manfred W. Padberg Classical cuts for mixed-integer programming and branch-and-cut , 2001, Math. Methods Oper. Res..

[10]  Leonidas S. Pitsoulis,et al.  Handbook on modelling for discrete optimization , 2006 .

[11]  Peter B. Luh,et al.  Efficient surrogate optimization for payment cost co-optimization with transmission capacity constraints , 2013, 2013 IEEE Power & Energy Society General Meeting.

[12]  H.J.C.P. Pinto,et al.  Short-Term Scheduling of Combined Cycle Units Using Mixed Integer Linear Programming Solution , 2013 .

[13]  Peter B. Luh,et al.  Convergence of the Surrogate Lagrangian Relaxation Method , 2015, J. Optim. Theory Appl..