Morales España, German Andres
Latorre Canteli, Jesús María
Ramos Galán, Andrés
2016-01-15T11:16:00Z
2016-01-15T11:16:00Z
2013-11-01
0885-8950
10.1109TPWRS.2013.2251373
Artículos en revistas
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 are 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.
application/pdf
en-GB
Revista: IEEE Transactions on Power Systems, Periodo: 1, Volumen: online, Número: 4, Página inicial: 4897, Página final: 4908
Instituto de Investigación Tecnológica (IIT)
Tight and compact MILP formulation for the thermal unit commitment problem
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
info:eu-repo/semantics/restrictedAccess
Mixed-integer linear programming, strong lower bounds, thermal units, unit commitment.