Internally Induced Branch-and-Cut Acceleration for Unit Commitment Based on Improvement of Upper Bound
- 27 January 2022
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 37 (3) , 2455-2458
Abstract
In this letter, we present an internally induced acceleration method for the branch-and-cut (B&C) process of unit commitment (UC) problem on the basis of general mixed-integer programming (MIP) solvers. The B&C process is internally guided by solving a small-scale induced MIP model formulated by combining the congestion management information with global upper and lower bounds. Based on the test cases of RTS-GMLC and practical utility data, the UC calculation can be accelerated by 2.29 and 2.06 times on average, respectively, with no influence on the solution optimality.Keywords
Funding Information
- National Natural Science Foundation of China (52177072)
- Academician-mentoring Scientific and Technological Innovation Project of Chongqing (cstc2021yszx-jscxX0002)
- Alibaba Group
This publication has 8 references indexed in Scilit:
- A High Performance Computing Based Market Economics Driven Neighborhood Search and Polishing Algorithm for Security Constrained Unit CommitmentIEEE Transactions on Power Systems, 2020
- A Systematic Formulation Tightening Approach for Unit Commitment ProblemsIEEE Transactions on Power Systems, 2019
- The IEEE Reliability Test System: A Proposed 2019 UpdateIEEE Transactions on Power Systems, 2019
- Time-Adaptive Unit CommitmentIEEE Transactions on Power Systems, 2019
- Transmission Constraint Filtering in Large-Scale Security-Constrained Unit CommitmentIEEE Transactions on Power Systems, 2019
- Ten years of feasibility pump, and countingEURO Journal on Computational Optimization, 2018
- A Novel Decomposition and Coordination Approach for Large Day-Ahead Unit Commitment With Combined Cycle UnitsIEEE Transactions on Power Systems, 2018
- Exploring relaxation induced neighborhoods to improve MIP solutionsMathematical Programming, 2004