2009•Unpublished venueRequires access

A New Hybrid Approach for Unit Commitment Using Lagrangian Relaxation Combined with Evolutionary and Quadratic Programming

Majid Bavafa, Hassan Monsef, N. Navidi

Open publisher page 13 citations

Abstract

This paper proposes an approach which combines Lagrangian relaxation principle with evolutionary programming and quadratic programming (LREQP) for short-term thermal unit commitment. Unit commitment is a complex combinatorial optimization problem which is difficult to be solved for large-scale power systems. This paper presents a hybrid method for ramp rate constrained unit commitment (RUC) problem. Hybrid LREQP minimizes the total supply cost subject to the power balance, generation ramp limit constraints, on/off line minimum level constraints, minimum up and new down time constraints and generator operating constraints. The proposed solution method solves unit commitment problem with two coordination procedures. In the first procedure, an evolutionary programming algorithm is used to improve a solution obtained by the Lagrangian relaxation method: Lagrangian relaxation gives the starting point for a evolutionary programming procedure. In the second procedure, economic dispatch (ED) by quadratic programming (QP) is performed 24 hours to simultaneously dispatch output subject to all constraints and unit decommitment is carried out. Hybrid LREQP is tested on the 26 unit IEEE reliability test system. The proposed algorithm takes the advantages of both methods and therefore it can search a better solution within short computation time.

About this research paper

What this paper is about

This paper proposes an approach which combines Lagrangian relaxation principle with evolutionary programming and quadratic programming (LREQP) for short-term thermal unit commitment. Unit commitment is a complex combinatorial optimization problem which is difficult to be solved for large-scale power systems. This paper presents a hybrid method for ramp rate constrained unit commitment (RUC) problem. Hybrid LREQP minimizes the total supply cost subject to the power balance, generation ramp limit constraints, on/off line minimum level constraints, minimum up and new down time constraints and generator operating constraints. The proposed solution method solves unit commitment problem with two coordination procedures. In the first procedure, an evolutionary programming algorithm is used to improve a solution obtained by the Lagrangian relaxation method: Lagrangian relaxation gives the starting point for a evolutionary programming procedure. In the second procedure, economic dispatch (ED) by quadratic programming (QP) is performed 24 hours to simultaneously dispatch output subject to all constraints and unit decommitment is carried out. Hybrid LREQP is tested on the 26 unit IEEE reliability test system. The proposed algorithm takes the advantages of both methods and therefore it can search a better solution within short computation time.

Why it matters

OpenAlex reports 13 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

This paper proposes an approach which combines Lagrangian relaxation principle with evolutionary programming and quadratic programming (LREQP) for short-term thermal unit commitment. Unit commitment is a complex combinatorial optimization problem which is difficult to be solved for large-scale power systems. This paper presents a hybrid method for ramp rate constrained unit commitment (RUC) problem. Hybrid LREQP minimizes the total supply cost subject to the power balance, generation ramp limit constraints, on/off line minimum level constraints, minimum up and new down time constraints and generator operating constraints. The proposed solution method solves unit commitment problem with two coordination procedures. In the first procedure, an evolutionary programming algorithm is used to improve a solution obtained by the Lagrangian relaxation method: Lagrangian relaxation gives the starting point for a evolutionary programming procedure. In the second procedure, economic dispatch (ED) by quadratic programming (QP) is performed 24 hours to simultaneously dispatch output subject to all constraints and unit decommitment is carried out. Hybrid LREQP is tested on the 26 unit IEEE reliability test system. The proposed algorithm takes the advantages of both methods and therefore it can search a better solution within short computation time.

Key concepts: Lagrangian relaxation, Power system simulation, Mathematical optimization, Economic dispatch, Quadratic programming, Sequential quadratic programming, Evolutionary programming, Relaxation (psychology)

Related papers

Back to paper searchBrowse research topicsOriginal source
A New Hybrid Approach for Unit Commitment Using Lagrangian Relaxation Combined with Evolutionary and Quadratic Programming — Research Paper | ScholarLens