Improved tight and effective two-binary-variable formulations for UC problems

This study presents two mixed-integer programmings formulations for the unit commitment (UC) problem. First, the authors proposed a variable upper bound-based UC formulation, which is simultaneously tight and compact. Moreover, the tighter and relatively compact multi-period formulation is also pres...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IET generation, transmission & distribution Ročník 14; číslo 9; s. 1663 - 1672
Hlavní autori: Yang, Linfeng, Fang, Beihua, Zhang, Chen, Li, Wei
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: The Institution of Engineering and Technology 11.05.2020
Predmet:
Base formulation
compact multi‐period formulation
computational time
integer programming
linear programming
mixed‐integer programmings formulations
Multi_New formulation
multiformulation
power generation dispatch
power generation scheduling
Research Article
time 24.0 hour
time 48.0 hour
two‐binary‐variable formulations
unit commitment problem
variable upper bound‐based UC formulation
unit commitment problem
two-binary-variable formulations
Base formulation
integer programming
time 48.0 hour
Multi_New formulation
linear programming
mixed-integer programmings formulations
variable upper bound-based UC formulation
power generation scheduling
power generation dispatch
time 24.0 hour
multiformulation
compact multi-period formulation
computational time
ISSN:1751-8687, 1751-8695
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This study presents two mixed-integer programmings formulations for the unit commitment (UC) problem. First, the authors proposed a variable upper bound-based UC formulation, which is simultaneously tight and compact. Moreover, the tighter and relatively compact multi-period formulation is also presented. Both formulations (‘Multi_New’ and ‘Mult’) are tighter than the previous 2-bin (Base) and the tighter characteristic largely reduces the computational time of the formulations. Compared to the ‘Base’ formulation, the proposed formulations reduced by at least 6.6%, even 42.1% in the average time of calculation. The proposed models were tested on 73 instances over a scheduling period of 24 and 48 h. Compared to the ‘Base’ formulation, the initial Gap of ‘New’ formulation is improved by at least 8.4%. Moreover, compared to ‘Multi’ formulation, the compactness of ‘Multi_New’ formulation is improved by at least 33%. In addition, the numeric experiments show dramatic improvements in computational time for their proposed models. They provide evidence that the proposed models have better performance than the previous models.
ISSN:1751-8687
1751-8695
DOI:10.1049/iet-gtd.2019.1542