Temporal Decomposition for Security-Constrained Unit Commitment

abstract

• This paper proposes a temporal decomposition strategy to reduce the computation time of security-constrained unit commitment (SCUC). The novelty of this paper is twofold. The scheduling horizon is decomposed into multiple subhorizons. The concept of coupling intervals is introduced, and a set of auxiliary counting variables and logical expressions along with their equivalent linear models are formulated to handle intertemporal ramp constraints and minimum on/off times between consecutive subhorizons. An accelerated analytical target cascading (A-ATC) algorithm is developed to coordinate SCUC subproblems and find the optimal solution for the whole operation horizon in a distributed manner. An initialization strategy is presented to enhance the convergence performance of A-ATC. The proposed algorithm is tested on four test systems.

authors

• Safdarian, Farnaz

published proceedings

• IEEE TRANSACTIONS ON POWER SYSTEMS

author list (cited authors)

• Safdarian, F., Mohammadi, A., & Kargarian, A.

citation count

• 12

complete list of authors

• Safdarian, Farnaz||Mohammadi, Ali||Kargarian, Amin

publication date

• May 2020

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

keywords

• Accelerated Analytical Target Cascading
• Acceleration
• Couplings
• Distributed Algorithms
• Economics
• Indexes
• Processor Scheduling
• Security-constrained Unit Commitment
• Temporal Decomposition
• Time Factors

Digital Object Identifier (DOI)

• 10.1109/TPWRS.2019.2947410

start page

• 1834

end page

• 1845

volume

• 35

issue

• 3

URL

• http://dx.doi.org/10.1109/tpwrs.2019.2947410