An improved integer coded genetic algorithm for security constrained unit commitment problem

Author

Golestani, S. ; Raoofat, M. ; Farjah, E.

Author_Institution

Dept. of Electr. Eng., Shiraz Univ., Shiraz

fYear

2008

fDate

1-3 Dec. 2008

Firstpage

1251

Lastpage

1255

Abstract

This paper presents a novel approach to solve the security constrained unit commitment problem using decomposition technique. The method applies an improved integer coded genetic algorithm (ICGA) to schedule the commitment states of units. ICGA technique reduces the size of chromosomes and computation time significantly. Here, the proposed ICGA has been enhanced by using perturbation operator. Simulation results for six-bus test system exhibit the effectiveness of the proposed approach.

Keywords

genetic algorithms; integer programming; power generation dispatch; power generation scheduling; power system security; decomposition technique; integer coded genetic algorithm; perturbation operator; security constrained unit commitment problem; six-bus test system; Cost function; Dynamic programming; Genetic algorithms; Lagrangian functions; Large-scale systems; Power generation; Power system dynamics; Power system security; Power system simulation; Production; Integer Coded Genetic Algorithm (ICGA); Perturbation operator; Security Constrained Unit Commitment (SCUC);

fLanguage

English

Publisher

ieee

Conference_Titel

Power and Energy Conference, 2008. PECon 2008. IEEE 2nd International

Conference_Location

Johor Bahru

Print_ISBN

978-1-4244-2404-7

Electronic_ISBN

978-1-4244-2405-4

Type

conf

DOI

10.1109/PECON.2008.4762668

Filename

4762668