Tighter Approximated MILP Formulations for Unit Commitment Problems

The short-term unit commitment (UC) problem in hydrothermal power generation is a large-scale, mixed-integer nonlinear program, which is difficult to solve efficiently, especially for large-scale instances. It is possible to approximate the nonlinear objective function of the problem by means of piecewise-linear functions, so that UC can be approximated by an mixed-integer linear program (MILP); applying the available efficient general-purpose MILP solvers to the resulting formulations, good quality solutions can be obtained in a relatively short amount of time. We build on this approach, presenting a novel way to approximating the nonlinear objective function based on a recently developed class of valid inequalities for the problem, called ldquoperspective cuts.rdquo At least for many realistic instances of a general basic formulation of UC, an MILP-based heuristic obtains comparable or slightly better solutions in less time when employing the new approach rather than the standard piecewise linearizations, while being not more difficult to implement and use. Furthermore, ldquodynamicrdquo formulations, whereby the approximation is iteratively improved, provide even better results if the approximation is appropriately controlled.

[1]  Allen J. Wood,et al.  Power Generation, Operation, and Control , 1984 .

[2]  O. Nilsson,et al.  Mixed-integer programming applied to short-term planning of a hydro-thermal system , 1995 .

[3]  Werner Römisch,et al.  Stochastic Lagrangian Relaxation Applied to Power Scheduling in a Hydro-Thermal System under Uncertainty , 2000, Ann. Oper. Res..

[4]  A. Conejo,et al.  Optimal response of a thermal unit to an electricity spot market , 2000 .

[5]  F. T. Sparrow,et al.  On convexity issues of short-term hydrothermal scheduling , 2000 .

[6]  Andrea Lodi,et al.  Lagrangian relaxation and Tabu Search approaches for the unit commitment problem , 2001, 2001 IEEE Porto Power Tech Proceedings (Cat. No.01EX502).

[7]  J. Waight,et al.  Experiences with Mixed Integer Linear Programming-Based Approaches in Short-Term Hydro Scheduling , 2001, IEEE Power Engineering Review.

[8]  Javier Contreras,et al.  Price maker self-scheduling in a pool-based electricity market: a mixed-integer LP approach , 2002 .

[9]  J. Contreras,et al.  Price-Maker Self-Scheduling in a Pool-Based Electricity Market: A Mixed-Integer LP Approach , 2002, IEEE Power Engineering Review.

[10]  A. Borghetti,et al.  Lagrangian Heuristics Based on Disaggregated Bundle Methods for Hydrothermal Unit Commitment , 2002, IEEE Power Engineering Review.

[11]  Alberto Borghetti,et al.  Using of a cost-based unit commitment algorithm to assist bidding strategy decisions , 2003, 2003 IEEE Bologna Power Tech Conference Proceedings,.

[12]  A.J. Conejo,et al.  Modeling of start-up and shut-down power trajectories of thermal units , 2004, IEEE Transactions on Power Systems.

[13]  Claudio Gentile,et al.  Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints , 2006, Oper. Res..

[14]  Claudio Gentile,et al.  Solving unit commitment problems with general ramp constraints , 2008 .

[15]  M. Carrion,et al.  A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem , 2006, IEEE Transactions on Power Systems.

[16]  Claudio Gentile,et al.  Perspective cuts for a class of convex 0–1 mixed integer programs , 2006, Math. Program..