A combination of the genetic algorithm and lagrangian relaxation decomposition techniques for the generation unit commitment problem

Unit commitment involves the scheduling of generators in a power system in order to meet the requirements of a given load profile. An analysis of the basis for combining the genetic algorithm (GA) and Lagrangian relaxation (LR) methods for the unit commitment problem is presented. It is shown that a...

Full description

Saved in:
Bibliographic Details
Published in:Electric power systems research 1997-12, Vol.43 (3), p.149-156
Main Authors: Orero, S.O., Irving, M.R.
Format: Article
Language:English
Subjects:
Generator scheduling
Genetic algorithm
Lagrangian relaxation
Unit commitment
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Unit commitment involves the scheduling of generators in a power system in order to meet the requirements of a given load profile. An analysis of the basis for combining the genetic algorithm (GA) and Lagrangian relaxation (LR) methods for the unit commitment problem is presented. It is shown that a robust unit commitment algorithm can be obtained by combining the global search property of the genetic algorithm with the ability of the Lagrangian decomposition technique to handle all kinds of constraints such as pollution, unit ramping and transmission security.
ISSN:0378-7796
1873-2046
DOI:10.1016/S0378-7796(97)01175-9