Deterministic optimization of the thermal Unit Commitment problem: A Branch and Cut search

Marcovecchio, Marian G.; Novais, Augusto Q.; Grossmann, Ignacio E.

http://hdl.handle.net/10400.9/2552

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
Computers&ChemicalEngineering_Vol.67_53.pdf		178.75 KB	Adobe PDF	Download

Send Feedback

Authors

Marcovecchio, Marian G.

Novais, Augusto Q.

Grossmann, Ignacio E.

Abstract(s)

This paper proposes a novel deterministic optimization approach for the Unit Commitment (UC) problem, involving thermal generating units. A mathematical programming model is first presented, whichincludes all the basic constraints and a set of binary variables for the on/off status of each generator ateach time period, leading to a convex mixed-integer quadratic programming (MIQP) formulation. Then,an effective solution methodology based on valid integer cutting planes is proposed, and implementedthrough a Branch and Cut search for finding the global optimal solution. The application of the pro-posed approach is illustrated with several examples of different dimensions. Comparisons with other mathematical formulations are also presented.

Keywords

Energy optimization Unit commitment problem Deterministic optimization Branch and Cut algorithm

URI

http://hdl.handle.net/10400.9/2552

Citation

Marcovecchio, M.G.; Novais, A.Q.; Grossmann, I.E. Deterministic optimization of the thermal Unit Commitment problem: A Branch and Cut search. In: Computers and Chemical Engineering, 2014, Vol. 67, p. 53-68