Improved tight and effective two‐binary‐variable formulations for UC problems
| Autor: | Chen Zhang, Beihua Fang, Linfeng Yang, Wei Li |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
021103 operations research
Linear programming 020209 energy 0211 other engineering and technologies Scheduling (production processes) Energy Engineering and Power Technology 02 engineering and technology Base (topology) Upper and lower bounds Variable (computer science) Compact space Relatively compact subspace Control and Systems Engineering 0202 electrical engineering electronic engineering information engineering Applied mathematics Electrical and Electronic Engineering Integer programming Mathematics |
| Zdroj: | IET Generation, Transmission & Distribution. 14:1663-1672 |
| ISSN: | 1751-8695 |
| DOI: | 10.1049/iet-gtd.2019.1542 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Plný text