22 March 2013 in IEEE Transactions on Power Systems
This paper presents a mixed-integer linear programming (MILP) reformulation of the thermal unit commitment (UC) problem. The proposed formulation is simultaneously tight and compact. The tighter characteristic reduces the search space and the more compact characteristic increases the searching speed with which solvers explore that reduced space. Therefore, as a natural consequence, the proposed formulation significantly reduces the computational burden in comparison with analogous MILP-based UC formulations. We provide computational results comparing the proposed formulation with two others which have been recognized as computationally efficient in the literature. The experiments were carried out on 40 different power system mixes and sizes, running from 28 to 1870 generating units.
29 November 2012 in IEEE Transactions on Power Systems
This paper presents a mixed-integer linear programming (MILP) formulation of start-up (SU) and shut-down (SD) power trajectories of thermal units. Multiple SU power-trajectories and costs are modeled according to how long the unit has been offline. The proposed formulation significantly reduces the computational burden in comparison with others commonly found in the literature. This is because the formulation is 1) tighter, i.e., the relaxed solution is nearer to the optimal integer solution; and 2) more compact, i.e., it needs fewer constraints, variables and nonzero elements in the constraint matrix. For illustration, the self-unit commitment problem faced by a thermal unit is employed. We provide computational results comparing the proposed formulation with others found in the literature.
15 October 2019 in IEEE Transactions on Power Systems
1 March 2017 in EURO Journal on Computational Optimization
23 May 2015 in OR Spectrum
This paper provides the convex hull description for the basic operation of slow- and quick-start units in power-based unit commitment (UC) problems. The basic operating constraints that are modeled for both types of units are (1) generation limits and (2) minimum up and down times. Apart from this, the startup and shutdown processes are also modeled, using (3) startup and shutdown power trajectories for slow-start units, and (4) startup and shutdown capabilities for quick-start units. In the conventional UC problem, power schedules are used to represent the staircase energy schedule; however, this simplification leads to infeasible energy delivery, as stated in the literature. To overcome this drawback, this paper provides a power-based UC formulation drawing a clear distinction between power and energy. The proposed constraints can be used as the core of any power-based UC formulation, thus tightening the final mixed-integer programming UC problem. We provide evidence that dramatic improvements in computational time are obtained by solving different case studies, for self-UC and network-constrained UC problems.