Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Logistics and Maritime Studies | en_US |
| dc.contributor.advisor | Pan, Kai (LMS) | en_US |
| dc.creator | Tian, Bin | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/12590 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | en_US |
| dc.rights | All rights reserved | en_US |
| dc.title | A polyhedral study on unit commitment with a single type of binary variables | en_US |
| dcterms.abstract | Efficient power production scheduling is a crucial concern for power system operators aiming to minimize the operational costs. Previous studies have primarily focused on Mixed-integer Linear Programming (MILP) formulations that utilize two or three types of binary variables for Unit Commitment (UC) problems. The investigation of strong formulations with a single type of binary variables has been limited, as it is believed to be challenging to derive strong valid inequalities for them (James Ostrowski, Anjos, and Vannelli 2012) and the improvement of compactness is often accompanied by a compromise in tightness (Ben Knueven, Jim Ostrowski, and J. Wang 2018). To address these difficulties, we consider a compact formulation for the UC problem using a single type of binary variables, which reduces the size of the search tree for the branch-and-cut algorithm. To enhance the tightness of this compact formulation, two-period UC polytope and multi-period strong valid inequalities involving single and two continuous variables are developed. Conditions under which these strong valid inequalities serve as facet-defining inequalities for the multi-period UC polytope are provided. As the number of these inequalities could be large, polynomial separation algorithms are proposed to find most violated inequalities. The efficacy of the derived strong valid inequalities in tightening the compact formulation is demonstrated through computational experiments on network-constrained UC problems. The result indicates that our strong valid inequalities can speed up the solution process of the compact formulation significantly. Particularly, our strong valid inequalities can also be used to tighten two/three-binary UC formulations. | en_US |
| dcterms.extent | ix, 231 pages | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 2023 | en_US |
| dcterms.educationalLevel | M.Phil. | en_US |
| dcterms.educationalLevel | All Master | en_US |
| dcterms.LCSH | Electric power production | en_US |
| dcterms.LCSH | Electric power systems -- Management | en_US |
| dcterms.LCSH | Electric power systems -- Mathematical models | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.accessRights | open access | en_US |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/12590