2012Power System Protection and ControlOpen access

A fast Lagrangian relaxation method for unit commitment

Xin Zhao

Open full text 3 citations

Abstract

A Fast Lagrangian Relaxation Method for unit commitment (UC) is proposed. This method has improved the following two aspects: one is that a heuristic inverse sorting algorithm is used to fix ON/OFF decision, avoiding starting more units due to too long update step of relaxing factors and accelerating convergence; the other is that an economic dispatch algorithm based on dichotomy is introduced. After getting the optimal active power of units in each step, a power regulating model of no-satisfying-climbing units is established and solved. Simulation examples with the number of generating units in the range of 10 to 100 show that much less time is consumed by the proposed method and good results can be achieved.

About this research paper

What this paper is about

A Fast Lagrangian Relaxation Method for unit commitment (UC) is proposed. This method has improved the following two aspects: one is that a heuristic inverse sorting algorithm is used to fix ON/OFF decision, avoiding starting more units due to too long update step of relaxing factors and accelerating convergence; the other is that an economic dispatch algorithm based on dichotomy is introduced. After getting the optimal active power of units in each step, a power regulating model of no-satisfying-climbing units is established and solved. Simulation examples with the number of generating units in the range of 10 to 100 show that much less time is consumed by the proposed method and good results can be achieved.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A Fast Lagrangian Relaxation Method for unit commitment (UC) is proposed. This method has improved the following two aspects: one is that a heuristic inverse sorting algorithm is used to fix ON/OFF decision, avoiding starting more units due to too long update step of relaxing factors and accelerating convergence; the other is that an economic dispatch algorithm based on dichotomy is introduced. After getting the optimal active power of units in each step, a power regulating model of no-satisfying-climbing units is established and solved. Simulation examples with the number of generating units in the range of 10 to 100 show that much less time is consumed by the proposed method and good results can be achieved.

Key concepts: Lagrangian relaxation, Power system simulation, Mathematical optimization, Sorting, Heuristic, Convergence (economics), Economic dispatch, Relaxation (psychology)

Related papers

Back to paper searchBrowse research topicsOriginal source
A fast Lagrangian relaxation method for unit commitment — Research Paper | ScholarLens