2012•International Journal of Scientific Engineering and TechnologyRequires access

Price Based Unit Commitment Problem Under Deregulation

P.V. Rama Krishna, Sukhdeo Sao

Open publisher page 7 citations

Abstract

The profit based unit commitment problem involves determining the time intervals at which a particular generating unit should be online and available for generation, and the associated generation or dispatch, the aim being to maximize its total profits based on a given price profile. This problem can be attacked by various techniques like single unit dynamic programming, lagrangian relaxation, genetic algorithm; particle swarm optimization etc. this paper describes how a dynamic programming optimization method is used to solve this complex optimization problem. All the usual unit constraints like minimum up time, minimum down time, and ramp up, ramp down limits are considered, after which results for the chosen 26 generating units are presented, and discussed.

About this research paper

What this paper is about

The profit based unit commitment problem involves determining the time intervals at which a particular generating unit should be online and available for generation, and the associated generation or dispatch, the aim being to maximize its total profits based on a given price profile. This problem can be attacked by various techniques like single unit dynamic programming, lagrangian relaxation, genetic algorithm; particle swarm optimization etc. this paper describes how a dynamic programming optimization method is used to solve this complex optimization problem. All the usual unit constraints like minimum up time, minimum down time, and ramp up, ramp down limits are considered, after which results for the chosen 26 generating units are presented, and discussed.

Why it matters

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

The profit based unit commitment problem involves determining the time intervals at which a particular generating unit should be online and available for generation, and the associated generation or dispatch, the aim being to maximize its total profits based on a given price profile. This problem can be attacked by various techniques like single unit dynamic programming, lagrangian relaxation, genetic algorithm; particle swarm optimization etc. this paper describes how a dynamic programming optimization method is used to solve this complex optimization problem. All the usual unit constraints like minimum up time, minimum down time, and ramp up, ramp down limits are considered, after which results for the chosen 26 generating units are presented, and discussed.

Key concepts: Lagrangian relaxation, Power system simulation, Mathematical optimization, Particle swarm optimization, Unit (ring theory), Dynamic programming, Computer science, Profit (economics)

Related papers

Back to paper searchBrowse research topicsOriginal source
Price Based Unit Commitment Problem Under Deregulation — Research Paper | ScholarLens