2002Unpublished venueRequires access

A solution of unit commitment with transmission and voltage constraints by heuristic method and optimal power flow

Hiroshi M. Sasaki, Tomoki Yamamoto, Junji Kubokawa, Takahiro Nagata, H. Fujita

Open publisher page 8 citations

Abstract

In this paper, a heuristic algorithm combined with OPF is proposed for short-term unit commitment problem with transmission and voltage constraints. Being a very complicated combinatorial optimization problem, unit commitment is very difficult to solve, especially, for large-scale power system with network constraints. We have proposed a heuristic algorithm based on the average full load cost without network constraints. In this study, we propose a solution of unit commitment problem with network constraints using combination of heuristic algorithm and OPF. The proposed algorithm has been applied to the IEEE 118 test system with 36 generators over a 24-h period. The result shows that the proposed algorithm is capable of obtaining satisfactory schedules without any constraint violation.

About this research paper

What this paper is about

In this paper, a heuristic algorithm combined with OPF is proposed for short-term unit commitment problem with transmission and voltage constraints. Being a very complicated combinatorial optimization problem, unit commitment is very difficult to solve, especially, for large-scale power system with network constraints. We have proposed a heuristic algorithm based on the average full load cost without network constraints. In this study, we propose a solution of unit commitment problem with network constraints using combination of heuristic algorithm and OPF. The proposed algorithm has been applied to the IEEE 118 test system with 36 generators over a 24-h period. The result shows that the proposed algorithm is capable of obtaining satisfactory schedules without any constraint violation.

Why it matters

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

In this paper, a heuristic algorithm combined with OPF is proposed for short-term unit commitment problem with transmission and voltage constraints. Being a very complicated combinatorial optimization problem, unit commitment is very difficult to solve, especially, for large-scale power system with network constraints. We have proposed a heuristic algorithm based on the average full load cost without network constraints. In this study, we propose a solution of unit commitment problem with network constraints using combination of heuristic algorithm and OPF. The proposed algorithm has been applied to the IEEE 118 test system with 36 generators over a 24-h period. The result shows that the proposed algorithm is capable of obtaining satisfactory schedules without any constraint violation.

Key concepts: Power system simulation, Mathematical optimization, Heuristic, Constraint (computer-aided design), Computer science, Transmission network, Electric power system, Voltage

Related papers

Back to paper searchBrowse research topicsOriginal source
A solution of unit commitment with transmission and voltage constraints by heuristic method and optimal power flow — Research Paper | ScholarLens