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

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 computati...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2008 IEEE 2nd International Power and Energy Conference s. 1251 - 1255
Hlavní autoři: Golestani, S., Raoofat, M., Farjah, E.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.12.2008
Témata:
Cost function
Dynamic programming
Genetic algorithms
Integer Coded Genetic Algorithm (ICGA)
Lagrangian functions
Large-scale systems
Perturbation operator
Power generation
Power system dynamics
Power system security
Power system simulation
Production
Security Constrained Unit Commitment (SCUC)
ISBN:1424424046, 9781424424047
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISBN:1424424046
9781424424047
DOI:10.1109/PECON.2008.4762668