.png){kind=icon}
Return
Improved tight and effective two‐binary‐variable formulations for UC problems
.png){kind=icon}
OA
AI
DOI：10.1049/iet-gtd.2019.1542.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
No journal information available
Organization
No organization information available
Cited Papers
No cited papers available